TY - JOUR
T1 - On optimal locally repairable codes with multiple disjoint repair sets
AU - Cai, Han
AU - Miao, Ying
AU - Schwartz, Moshe
AU - Tang, Xiaohu
N1 - Funding Information:
Manuscript received October 12, 2018; revised July 13, 2019; accepted September 16, 2019. Date of publication September 30, 2019; date of current version March 17, 2020. H. Cai and M. Schwartz were supported in part by the German Israeli Project Cooperation (DIP) under Grant PE2398/1-1. Y. Miao was supported in part by the JSPS Grant-in-Aid for Scientific Research (B) under Grant 18H01133. X. Tang was supported in part by the National Natural Science Foundation of China under Grant 61871331.
Publisher Copyright:
© 1963-2012 IEEE.
PY - 2020/4/1
Y1 - 2020/4/1
N2 - Locally repairable codes are desirable for distributed storage systems to improve the repair efficiency. In this paper, a new combination of codes with locality and codes with multiple disjoint repair sets (also called availability) is introduced. Accordingly, a Singleton-type bound is derived for the new code, which contains those bounds in [9], [20], [28] as special cases. Optimal constructions are proposed with respect to the new bound. In addition, these constructions can also generate optimal codes with multiple disjoint repair sets with respect to the bound in [28], which to the best of our knowledge, are the first explicit constructions that can achieve the bound in [28].
AB - Locally repairable codes are desirable for distributed storage systems to improve the repair efficiency. In this paper, a new combination of codes with locality and codes with multiple disjoint repair sets (also called availability) is introduced. Accordingly, a Singleton-type bound is derived for the new code, which contains those bounds in [9], [20], [28] as special cases. Optimal constructions are proposed with respect to the new bound. In addition, these constructions can also generate optimal codes with multiple disjoint repair sets with respect to the bound in [28], which to the best of our knowledge, are the first explicit constructions that can achieve the bound in [28].
KW - Availability
KW - distributed storage
KW - locally repairable code
UR - http://www.scopus.com/inward/record.url?scp=85082176487&partnerID=8YFLogxK
U2 - 10.1109/TIT.2019.2944397
DO - 10.1109/TIT.2019.2944397
M3 - Article
AN - SCOPUS:85082176487
SN - 0018-9448
VL - 66
SP - 2402
EP - 2416
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 4
M1 - 8852725
ER -