A construction of maximally recoverable codes
Abstract
We construct a family of linear maximally recoverable codes with locality r and dimension r+1. For codes of length n with r≈ nα, 0α 1 the code alphabet is of the order n1+3α, which improves upon the previously known constructions of maximally recoverable codes.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.