On Distance Properties of (r, t,x)-LRC Codes

Stanislav Kruglik, Kamilla Nazirkhanova, Alexey Frolov

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

    3 Citations (Scopus)

    Abstract

    We continue our investigation of one possible generalization of locally recoverable codes (LRC) with all-symbol locality and availability when recovering sets can intersect in a small number of coordinates. This feature allows us to increase the achievable code rate and still meet load balancing requirements. In this paper we derive upper and lower bounds on the minimum distance of such codes. The upper bound is based on generalized Hamming weights (GHWs) that are fundamental parameters of any linear codes with many useful applications. In order to derive a lower bound we propose an explicit construction of (r, t, x), -LRC via rank-metric codes and previously developed high rate (r, t, x) -LRC codes.

    Original languageEnglish
    Title of host publication2018 IEEE International Symposium on Information Theory, ISIT 2018
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages1336-1339
    Number of pages4
    ISBN (Print)9781538647806
    DOIs
    Publication statusPublished - 15 Aug 2018
    Event2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States
    Duration: 17 Jun 201822 Jun 2018

    Publication series

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

    Conference

    Conference2018 IEEE International Symposium on Information Theory, ISIT 2018
    Country/TerritoryUnited States
    CityVail
    Period17/06/1822/06/18

    Fingerprint

    Dive into the research topics of 'On Distance Properties of (r, t,x)-LRC Codes'. Together they form a unique fingerprint.

    Cite this