A Construction of Maximally Recoverable Codes With Order-Optimal Field Size

被引：26
作者：
Cai, Han [1 ]
Miao, Ying [2 ]
Schwartz, Moshe [3 ]
Tang, Xiaohu [1 ]
机构：
[1] Southwest Jiaotong Univ, Sch Informat Sci & Technol, Chengdu 610031, Peoples R China
[2] Univ Tsukuba, Fac Engn Informat & Syst, Tsukuba, Ibaraki 3058573, Japan
[3] Ben Gurion Univ Negev, Sch Elect & Comp Engn, IL-8410501 Beer Sheva, Israel
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2022年 / 68卷 / 01期
基金：
中国国家自然科学基金; 日本学术振兴会;
关键词：
Codes; Maintenance engineering; Hamming distance; Reed-Solomon codes; Linear codes; Codecs; Bandwidth; Distributed storage; linearized Reed-Solomon codes; locally repairable codes; maximally recoverable codes; partial MDS codes; sum-rank metric; LOCALLY REPAIRABLE CODES; PARTIAL MDS CODES; AUTOMORPHISM-GROUPS; BOUNDS;
D O I：
10.1109/TIT.2021.3120016
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We construct maximally recoverable codes (corresponding to partial MDS codes) which are based on linearized Reed-Solomon codes. The new codes have a smaller field size requirement compared with known constructions. For certain asymptotic regimes, the constructed codes have order-optimal alphabet size, asymptotically matching the known lower bound.
引用
收藏
页码：204 / 212
页数：9
相关论文
共 48 条
[1]   Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols [J].
Blaum, Mario ;
Plank, James S. ;
Schwartz, Moshe ;
Yaakobi, Eitan .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (05) :2673-2681
[2]   Partial-MDS Codes and Their Application to RAID Type of Architectures [J].
Blaum, Mario ;
Hafner, James Lee ;
Hetzler, Steven .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (07) :4510-4519
[3]   Bounds on the Size of Locally Recoverable Codes [J].
Cadambe, Viveck R. ;
Mazumdar, Arya .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (11) :5787-5794
[4]   On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes [J].
Cai, Han ;
Schwartz, Moshe .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (02) :686-704
[5]   On Optimal Locally Repairable Codes With Super-Linear Length [J].
Cai, Han ;
Miao, Ying ;
Schwartz, Moshe ;
Tang, Xiaohu .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (08) :4853-4868
[6]   On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets [J].
Cai, Han ;
Miao, Ying ;
Schwartz, Moshe ;
Tang, Xiaohu .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (04) :2402-2416
[7]   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
[8]   A General Construction for PMDS Codes [J].
Calis, Gokhan ;
Koyluoglu, O. Ozan .
IEEE COMMUNICATIONS LETTERS, 2017, 21 (03) :452-455
[9]   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
[10]  
Chen ZT, 2020, IEEE INT SYMP INFO, P616, DOI [10.1109/isit44484.2020.9174243, 10.1109/ISIT44484.2020.9174243]
12345