TY - GEN
T1 - Bounds and constructions of codes with multiple localities
AU - Zeh, Alexander
AU - Yaakobi, Eitan
N1 - Publisher Copyright: © 2016 IEEE.
PY - 2016/8/10
Y1 - 2016/8/10
N2 - This paper studies bounds and constructions of locally repairable codes (LRCs) with multiple localities so-called multiple-locality LRCs (ML-LRCs). In the simplest case of two localities some code symbols of an ML-LRC have a certain locality while the remaining code symbols have another one. We extend two bounds, the Singleton and the alphabet-dependent upper bound on the dimension of Cadambe-Mazumdar for LRCs, to the case of ML-LRCs with more than two localities. Furthermore, we construct Singleton-optimal ML-LRCs codes.
AB - This paper studies bounds and constructions of locally repairable codes (LRCs) with multiple localities so-called multiple-locality LRCs (ML-LRCs). In the simplest case of two localities some code symbols of an ML-LRC have a certain locality while the remaining code symbols have another one. We extend two bounds, the Singleton and the alphabet-dependent upper bound on the dimension of Cadambe-Mazumdar for LRCs, to the case of ML-LRCs with more than two localities. Furthermore, we construct Singleton-optimal ML-LRCs codes.
UR - http://www.scopus.com/inward/record.url?scp=84985919295&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2016.7541377
DO - 10.1109/ISIT.2016.7541377
M3 - منشور من مؤتمر
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 640
EP - 644
BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
T2 - 2016 IEEE International Symposium on Information Theory, ISIT 2016
Y2 - 10 July 2016 through 15 July 2016
ER -