On the maximal code length of optimal linear LRC codes with availability

Stanislav Kruglik, Kamilla Nazirkhanova, Alexey Frolov

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Citation (Scopus)

    Abstract

    A code over finite alphabet is said to be locally recoverable (LRC) if each code symbol is function of small number of other symbols forming the recovering set [1], [2], [3], [4], [5]. These codes were first proposed in [1] and immediate become popular due to obvious applications in distributed and cloud storage systems. Natural generalization of LRC codes is LRC codes with availability in which each code symbol has more than one disjoint recovering set. A LRC codes with availability is said to be optimal if its minimum distance achieves the Singleton-like bound developed by Kruglik et. al in this paper we study the maximum code length of q-ary optimal LRC with availability and then derive some structural properties.

    Original languageEnglish
    Title of host publicationProceedings - 5th International Conference on Engineering and Telecommunication, EnT-MIPT 2018
    EditorsElena Pavlyukova, Lyudmila Uzhinskaya
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages54-57
    Number of pages4
    ISBN (Electronic)9781728104317
    DOIs
    Publication statusPublished - Nov 2018
    Event5th International Conference on Engineering and Telecommunication, EnT-MIPT 2018 - Moscow, Russian Federation
    Duration: 15 Nov 201816 Nov 2018

    Publication series

    NameProceedings - 5th International Conference on Engineering and Telecommunication, EnT-MIPT 2018

    Conference

    Conference5th International Conference on Engineering and Telecommunication, EnT-MIPT 2018
    Country/TerritoryRussian Federation
    CityMoscow
    Period15/11/1816/11/18

    Keywords

    • distributed storage
    • index coding
    • information theory
    • locality
    • network coding

    Fingerprint

    Dive into the research topics of 'On the maximal code length of optimal linear LRC codes with availability'. Together they form a unique fingerprint.

    Cite this