A construction of maximally recoverable codes

Alexander Barg, Zitan Chen, Itzhak Tamo

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)939-945
Number of pages7
JournalDesigns, Codes, and Cryptography
Volume90
Issue number4
DOIs
StatePublished - Apr 2022

Funding

FundersFunder number
NSF-BSFCCF2110113
National Science FoundationCCF2104489
Horizon 2020 Framework Programme852953
Iowa Science Foundation
Engineering Research Centers
European Research Council
Israel Science Foundation1030/15

    Keywords

    • Codes with local recovery
    • Distributed storage
    • Maximally recoverable codes

    Fingerprint

    Dive into the research topics of 'A construction of maximally recoverable codes'. Together they form a unique fingerprint.

    Cite this