On one generalization of LRC codes with availability

Stanislav Kruglik, Marina Dudina, Valeriya Potapova, Alexey Frolov

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

    9 Citations (Scopus)

    Abstract

    We investigate 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 an upper bound for the rate of such codes and give explicit constructions of codes with such a property. These constructions utilize LRC codes developed by Wang et al.

    Original languageEnglish
    Title of host publication2017 IEEE Information Theory Workshop, ITW 2017
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages26-30
    Number of pages5
    ISBN (Electronic)9781509030972
    DOIs
    Publication statusPublished - 31 Jan 2018
    Event2017 IEEE Information Theory Workshop, ITW 2017 - Kaohsiung, Taiwan, Province of China
    Duration: 6 Nov 201710 Nov 2017

    Publication series

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

    Conference

    Conference2017 IEEE Information Theory Workshop, ITW 2017
    Country/TerritoryTaiwan, Province of China
    CityKaohsiung
    Period6/11/1710/11/17

    Fingerprint

    Dive into the research topics of 'On one generalization of LRC codes with availability'. Together they form a unique fingerprint.

    Cite this