CLAY AND PRODUCT-MATRIX MSR CODES WITH LOCALITY

被引：0
作者：
Gao, Minhan [1 ]
Holzbaur, Lukas [1 ]
Wachter-zeh, Antonia [1 ]
机构：
[1] Tech Univ Munich, Inst Commun Engn, Munich, Germany
来源：
ADVANCES IN MATHEMATICS OF COMMUNICATIONS | 2024年 / 18卷 / 05期
关键词：
Regenerating codes; MSR codes; locality; PMDS codes; local regeneration; PARTIAL MDS CODES; DISTRIBUTED STORAGE;
D O I：
10.3934/amc.2023002
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Regenerating codes and codes with locality address the efficiency of the node repair problem. While regeneration reduces the repair bandwidth, locality reduces the number of nodes required for the repair of a small number of nodes. This work considers the combination of minimum storage regen-erating codes, an optimal subclass of regenerating codes, and PMDS codes, a particularly strong type of code with locality. Two new constructions are proposed in this paper. The first construction decreases the subpacketization mu n from rn to r r for all considered parameters of PMDS codes, and the second one achieves a significantly lower subpacketization n - r - 1 when the global redundancy is s = 1.
引用
收藏
页码：1480 / 1491
页数：12
相关论文
共 50 条
[41]   Constructing MSR Codes With Subpacketization 2n/3 for k+1 Helper Nodes [J].
Wang, Ningning ;
Li, Guodong ;
Hu, Sihuang ;
Ye, Min .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (06) :3775-3792
[42]   Small-d MSR Codes With Optimal Access, Optimal Sub-Packetization, and Linear Field Size [J].
Vajha, Myna ;
Balaji, S. B. ;
Kumar, P. Vijay .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (07) :4303-4332
[43]   Explicit Constructions of High-Rate MSR Codes With Optimal Access Property Over Small Finite Fields [J].
Liu, Yi ;
Li, Jie ;
Tang, Xiaohu .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (10) :4405-4413
[44]   ON THE FAULT-TOLERANCE OF UNIFIED-FORM EXACT-MSR CODES [J].
Lin, Sian-Jheng ;
Chung, Wei-Ho ;
Han, Yunghsiang S. .
2014 6TH INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS, CONTROL AND SIGNAL PROCESSING (ISCCSP), 2014, :1-4
[45]   Locality and Availability of Array Codes Constructed From Subspaces [J].
Silberstein, Natalia ;
Etzion, Tuvi ;
Schwartz, Moshe .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (05) :2648-2660
[46]   Explicit MBR All-Symbol Locality Codes [J].
Kamath, Govinda M. ;
Silberstein, Natalia ;
Prakash, N. ;
Rawat, Ankit S. ;
Lalitha, V. ;
Koyluoglu, O. Ozan ;
Kumar, P. Vijay ;
Vishwanath, Sriram .
2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, :504-+
[47]   Exploring Node Repair Locality in Fractional Repetition Codes [J].
Zhu, Bing ;
Li, Hui .
IEEE COMMUNICATIONS LETTERS, 2016, 20 (12) :2350-2353
[48]   On Fault Tolerance, Locality, and Optimality in Locally Repairable Codes [J].
Kolosov, Oleg ;
Yadgar, Gala ;
Liram, Matan ;
Tamo, Itzhak ;
Barg, Alexander .
PROCEEDINGS OF THE 2018 USENIX ANNUAL TECHNICAL CONFERENCE, 2018, :865-877
[49]   On the locality of codeword symbols in non-linear codes [J].
Forbes, Michael ;
Yekhanin, Sergey .
DISCRETE MATHEMATICS, 2014, 324 :78-84
[50]   On the Locality and Availability of Linear Codes Based on Finite Geometry [J].
Shen, Lin-Zhi ;
Fu, Fang-Wei ;
Guang, Xuan .
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2015, E98A (11) :2354-2355
12345