A family of codes with variable locality and availability
C\'icero Carvalho, Victor G.L. Neumann

TL;DR
This paper introduces a new class of locally recoverable codes with variable recovery options and multiple recovery sets, enhancing data resilience and flexibility in error correction.
Contribution
It defines a novel family of codes with variable locality and availability, allowing multiple recovery sets and robustness against erasures within recovery groups.
Findings
Codes support multiple, distinct recovery sets for each position
Recovery is possible despite erasures in some recovery set entries
The class generalizes existing locally recoverable codes with variable parameters
Abstract
In this work we present a class of locally recoverable codes, i.e. codes where an erasure at a position of a codeword may be recovered from the knowledge of the entries in the positions of a recovery set . The codes in the class that we define have availability, meaning that for each position there are several distinct recovery sets. Also, the entry at position may be recovered even in the presence of erasures in some of the positions of the recovery sets, and the number of supported erasures may vary among the various recovery sets.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Cellular Automata and Applications · Coding theory and cryptography
