A construction of maximally recoverable codes
Information Theory
2023-03-07 v1 Combinatorics
math.IT
Abstract
We construct a family of linear maximally recoverable codes with locality and dimension For codes of length with the code alphabet is of the order which improves upon the previously known constructions of maximally recoverable codes.
Cite
@article{arxiv.2108.08679,
title = {A construction of maximally recoverable codes},
author = {Alexander Barg and Zitan Chen and Itzhak Tamo},
journal= {arXiv preprint arXiv:2108.08679},
year = {2023}
}