@inproceedings{064bc7e9c0a2454cb683507c826e0837,
title = "Combinatorial and LP bounds for LRC codes",
abstract = "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.",
author = "Sihuang Hu and Itzhak Tamo and Alexander Barg",
note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; null ; Conference date: 10-07-2016 Through 15-07-2016",
year = "2016",
month = aug,
day = "10",
doi = "10.1109/ISIT.2016.7541451",
language = "אנגלית",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1008--1012",
booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",
address = "ארצות הברית",
}