A Construction of Maximally Recoverable Codes with Order-Optimal Field Size

2020/11/27 by Cai, Han, Miao, Ying, Schwartz, Moshe +1 · 7 citations
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2011.13606

Abstract

We construct maximally recoverable codes (corresponding to partial MDS codes) which are based on linearized Reed-Solomon codes. The new codes have a smaller field size requirement compared with known constructions. For certain asymptotic regimes, the constructed codes have order-optimal alphabet size, asymptotically matching the known lower bound.

Cited by

• Two-Step Decoding of Binary 2×2 Sum-Rank-Metric Codes
• Undirected Multicast Network Coding Gaps via Locally Decodable Codes
• From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
• Improved Constructions and Lower Bounds for Maximally Recoverable Grid Codes
• Optimal Quantum (r,δ)-Locally Repairable Codes From Matrix-Product Codes
• Optimal Quantum (r,δ)-Locally Repairable Codes via Classical Ones
• Constructions and List Decoding of Sum-Rank Metric Codes Based on Orthogonal Spaces over Finite Fields

Related

• On Partial Maximally-Recoverable and Maximally-Recoverable Codes
• Improved Schemes for Asymptotically Optimal Repair of MDS Codes
• AG Codes Achieve List-decoding Capacity over Constant-sized Fields
• Near-Optimal List-Recovery of Linear Code Families
• A construction of optimal locally recoverable codes