A construction of maximally recoverable codes (Q2119945)

From MaRDI portal
Revision as of 22:53, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A construction of maximally recoverable codes
scientific article

    Statements

    A construction of maximally recoverable codes (English)
    0 references
    0 references
    0 references
    0 references
    31 March 2022
    0 references
    In this paper, the authors consider linear maximally recoverable (MR) codes. The main problems related to MR codes are: the minimum field size \(q\) required to construct an MR code with a given set of parameters, and finding explicit constructions of MR codes. They construct a family of MR codes with locality \(r\) and dimension \(r + 1\). The idea of their construction is based on the construction given by \textit{S. Gopi} et al. [IEEE Trans. Inf. Theory 66, No. 10, 6066--6083 (2020; Zbl 1452.94113)] that gave codes with locality \(r = 3\). The obtained results improve upon the previously known constructions of maximally recoverable codes.
    0 references
    distributed storage
    0 references
    codes with local recovery
    0 references
    maximally recoverable codes
    0 references

    Identifiers