Locally recoverable -affine variety codes
arXiv:1911.07485 · doi:10.1016/j.ffa.2020.101661
Abstract
A locally recoverable (LRC) code is a code over a finite field such that any erased coordinate of a codeword can be recovered from a small number of other coordinates in that codeword. We construct LRC codes correcting more than one erasure, which are subfield-subcodes of some -affine variety codes. For these LRC codes, we compute localities that determine the minimum size of a set of positions so that any erasures in can be recovered from the remaining coordinates in this set. We also show that some of these LRC codes with lengths are -optimal.
References in corpus (9)
- Repair Locality with Multiple Erasure Tolerance
- Binary Cyclic Codes that are Locally Repairable
- Cooperative Local Repair in Distributed Storage
- Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes
- Stabilizer quantum codes from -affine variety codes and a new Steane-like enlargement
- Quantum codes from affine variety codes and their subfield-subcodes
- On the distance of stabilizer quantum codes from -affine variety codes
- New binary and ternary LCD codes
- Classical and Quantum Evaluation Codes at the Trace Roots