TY - GEN
T1 - Bounds on locally recoverable codes with multiple recovering sets
AU - Tamo, Itzhak
AU - Barg, Alexander
PY - 2014
Y1 - 2014
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84906535760&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2014.6874921
DO - 10.1109/ISIT.2014.6874921
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84906535760
SN - 9781479951864
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 691
EP - 695
BT - 2014 IEEE International Symposium on Information Theory, ISIT 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2014 IEEE International Symposium on Information Theory, ISIT 2014
Y2 - 29 June 2014 through 4 July 2014
ER -