A construction of maximally recoverable codes

DOI10.1007/s10623-022-01020-8OpenAlexW4213145874WikidataQ114849777 ScholiaQ114849777MaRDI QIDQ2119945

Itzhak Tamo, Alexander Barg, Zitan Chen

Publication date: 31 March 2022

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.08679

zbMATH Keywords

distributed storagemaximally recoverable codescodes with local recovery

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60)

Related Items (2)

A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices ⋮ Codes for Distributed Storage

Cites Work

• Random construction of partial MDS codes
• Explicit Maximally Recoverable Codes With Locality
• A Construction of Maximally Recoverable Codes With Order-Optimal Field Size
• Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities
• Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields
• Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
• Constructions of Partial MDS Codes Over Small Fields
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression

This page was built for publication: A construction of maximally recoverable codes