Constructions of Optimal Single-parity Locally Repairable Codes with Multiple Repair Sets

被引：0

作者：

Ding, Yang ^{[1
]}

Li, Qingye ^{[1
]}

Qiu, Yuting ^{[1
]}

机构：

[1] Shanghai Univ, Dept Math, Shanghai, Peoples R China

来源：

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2022年 / E105卷 / 08期

基金：

中国国家自然科学基金;

关键词：

Locally repairable codes; availability; distributed storage systems; linear codes;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Locally repairable codes have attracted lots of interest in Distributed Storage Systems. If a symbol of a code can be repaired respectively by t disjoint groups of other symbols, each groups has size at most r, we say that the code symbol has (r, t)-locality. In this paper, we employ parity-check matrix to construct information single-parity (r, t)-locality LRCs. All our codes attain the Singleton-like bound of LRCs where each repair group contains a single parity symbol and thus are optimal.

引用

页数：5

共 21 条

[1] Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6 [J].

Chen, Bin ;

Fang, Weijun ;

Xia, Shu-Tao ;

Hao, Jie ;

Fu, Fang-Wei .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (01) :217-231

[2] On the Locality of Codeword Symbols [J].

Gopalan, Parikshit ;

Huang, Cheng ;

Simitci, Huseyin ;

Yekhanin, Sergey .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (11) :6925-6934

[3]

Hao J., 2016, P IEEE INFOCOM, P1

[4] Constructions of Optimal Binary Locally Repairable Codes With Multiple Repair Groups [J].

Hao, Jie ;

Xia, Shu-Tao .

IEEE COMMUNICATIONS LETTERS, 2016, 20 (06) :1060-1063

[5]

Huang C., 2012, P 2012 USENIX C ANN

[6] Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems [J].

Huang, Cheng ;

Chen, Minghua ;

Li, Jin .

SIXTH IEEE INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS, PROCEEDINGS, 2007, :79-+

[7]

Huang PF, 2015, IEEE INT SYMP INFO, P1871, DOI 10.1109/ISIT.2015.7282780

[8]

Ionin Y. J., 2006, COMBINATORICS SYMMET

[9] Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields [J].

Jin, Lingfei ;

Ma, Liming ;

Xing, Chaoping .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (01) :210-221

[10] Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes [J].

Jin, Lingfei .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (08) :4658-4663

← 1 2 3 →