• DocumentCode
    1779710
  • Title

    Bounds on locally recoverable codes with multiple recovering sets

  • Author

    Tamo, Itzhak ; Barg, Alexander

  • Author_Institution
    Dept. of ECE, Univ. of Maryland, College Park, MD, USA
  • fYear
    2014
  • fDate
    June 29 2014-July 4 2014
  • Firstpage
    691
  • Lastpage
    695
  • Abstract
    A locally recoverable code (LRC code) is a code over a finite alphabet such that every symbol in the encoding is a function of a small number of other symbols that form a recovering set. Bounds on the rate and distance of such codes have been extensively studied in the literature. In this paper we derive upper bounds on the rate and distance of codes in which every symbol has t ≥ 1 disjoint recovering sets.
  • Keywords
    codes; LRC code; finite alphabet; locally recoverable code; multiple recovering sets; Availability; Color; Educational institutions; Encoding; Silicon; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory (ISIT), 2014 IEEE International Symposium on
  • Conference_Location
    Honolulu, HI
  • Type

    conf

  • DOI
    10.1109/ISIT.2014.6874921
  • Filename
    6874921
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1779710