Bounds and constructions of codes with all-symbol locality and availability

Stanislav Kruglik, Alexey Frolov

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

    8 Citations (Scopus)

    Abstract

    We investigate the distance properties of linear locally recoverable codes (LRC codes) with all-symbol locality and availability. New upper and lower bounds on the minimum distance of such codes are derived. The upper bound is based on the shortening method and improves existing shortening bounds. To reduce the gap in between upper and lower bounds we do not restrict the alphabet size and propose explicit constructions of codes with locality and availability via rank-metric codes. The first construction relies on expander graphs and is better in low rate region, the second construction utilizes LRC codes developed by Wang et al. as inner codes and better in high rate region.

    Original languageEnglish
    Title of host publication2017 IEEE International Symposium on Information Theory, ISIT 2017
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages1023-1027
    Number of pages5
    ISBN (Electronic)9781509040964
    DOIs
    Publication statusPublished - 9 Aug 2017
    Event2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany
    Duration: 25 Jun 201730 Jun 2017

    Publication series

    NameIEEE International Symposium on Information Theory - Proceedings
    ISSN (Print)2157-8095

    Conference

    Conference2017 IEEE International Symposium on Information Theory, ISIT 2017
    Country/TerritoryGermany
    CityAachen
    Period25/06/1730/06/17

    Fingerprint

    Dive into the research topics of 'Bounds and constructions of codes with all-symbol locality and availability'. Together they form a unique fingerprint.

    Cite this