TY - GEN
T1 - Combinatorial and LP bounds for LRC codes
AU - Hu, Sihuang
AU - Tamo, Itzhak
AU - Barg, Alexander
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/8/10
Y1 - 2016/8/10
N2 - A locally recoverable (LRC) code is a code that enables a simple recovery of an erased symbol by accessing only a small number of other symbols. We present several new combinatorial bounds on LRC codes including the locality-aware sphere packing and Plotkin bounds. We also develop an approach to linear programming (LP) bounds on LRC codes. The resulting LP bound gives better estimates in examples than the other upper bounds known in the literature.
AB - A locally recoverable (LRC) code is a code that enables a simple recovery of an erased symbol by accessing only a small number of other symbols. We present several new combinatorial bounds on LRC codes including the locality-aware sphere packing and Plotkin bounds. We also develop an approach to linear programming (LP) bounds on LRC codes. The resulting LP bound gives better estimates in examples than the other upper bounds known in the literature.
UR - http://www.scopus.com/inward/record.url?scp=84985942528&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2016.7541451
DO - 10.1109/ISIT.2016.7541451
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84985942528
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1008
EP - 1012
BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 10 July 2016 through 15 July 2016
ER -