On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets

被引：24

作者：

Cai, Han ^{[1
]}

Miao, Ying ^{[2
]}

Schwartz, Moshe ^{[1
]}

Tang, Xiaohu ^{[3
]}

机构：

[1] Ben Gurion Univ Negev, Sch Elect & Comp Engn, IL-8410501 Beer Sheva, Israel

[2] Univ Tsukuba, Fac Engn Informat & Syst, Tsukuba, Ibaraki 3058573, Japan

[3] Southwest Jiaotong Univ, Informat Secur & Natl Comp Grid Lab, Chengdu 610031, Peoples R China

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2020年 / 66卷 / 04期

基金：

中国国家自然科学基金;

关键词：

Availability; distributed storage; locally repairable code;

D O I：

10.1109/TIT.2019.2944397

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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].

引用

页码：2402 / 2416

页数：15

共 29 条

[1] Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes [J].

Agarwal, Abhishek ;

Barg, Alexander ;

Hu, Sihuang ;

Mazumdar, Arya ;

Tamo, Itzhak .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (05) :3481-3492

[2]

[Anonymous], [No title captured]

[3]

[Anonymous], [No title captured]

[4] Bounds on the Size of Locally Recoverable Codes [J].

Cadambe, Viveck R. ;

Mazumdar, Arya .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (11) :5787-5794

[5]

Cadambe VR, 2011, IEEE INT SYMP INFO, P1225, DOI 10.1109/ISIT.2011.6033730

[6] Optimal Locally Repairable Systematic Codes Based on Packings [J].

Cai, Han ;

Cheng, Minquan ;

Fan, Cuiling ;

Tang, Xiaohu .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (01) :39-49

[7] On the locality of codeword symbols in non-linear codes [J].

Forbes, Michael ;

Yekhanin, Sergey .

DISCRETE MATHEMATICS, 2014, 324 :78-84

[8] Network Coding Fundamentals [J].

Fragouli, Christina ;

Soljanin, Emina .

FOUNDATIONS AND TRENDS IN NETWORKING, 2007, 2 (01) :1-133

[9]

Gabidulin E. M., 1985, Problems of Information Transmission, V21, P1

[10] Explicit Maximally Recoverable Codes With Locality [J].

Gopalan, Parikshit ;

Huang, Cheng ;

Jenkins, Bob ;

Yekhanin, Sergey .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (09) :5245-5256

← 1 2 3 →