Small-d MSR Codes With Optimal Access, Optimal Sub-Packetization, and Linear Field Size

被引：5

作者：

Vajha, Myna ^{[1
]}

Balaji, S. B. ^{[2
]}

Kumar, P. Vijay ^{[3
]}

机构：

[1] Qualcomm, Bengaluru 560056, India

[2] NXP, Bengaluru 560045, India

[3] Indian Inst Sci Bengaluru, Dept Elect Commun Engn, Bengaluru 560012, India

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2023年 / 69卷 / 07期

关键词：

Coding theory; distributed storage; regenerating codes; minimum storage regenerating (MSR) codes; optimal access repair; Small-d codes; optimal sub-packetization level codes; MDS CODES; DISTRIBUTED STORAGE; REGENERATING CODES; OPTIMAL REPAIR;

D O I：

10.1109/TIT.2023.3250458

中图分类号：

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

学科分类号：

0812 ;

摘要：

This paper presents an explicit construction of a class of optimal-access, minimum storage regenerating (MSR) codes, for small values of the number d of helper nodes. The construction is valid for any parameter set (n, k, d) with d. {k + 1, k + 2, k + 3} and employs a finite field Fq of size q = O(n). We will refer to the constructed codes as Small- d MSR codes. The sub-packetization level a is given by a = s. ns., where s = d-k+ 1. By an earlier result on the sub-packetization level for optimal-access MSR codes, this is the smallest value possible.

引用

页码：4303 / 4332

页数：30

共 50 条

[1] ε-MSR Codes with Small Sub-packetization
Rawat, Ankit Singh
Tamo, Itzhak
Guruswami, Venkatesan
Efremeko, Klim
2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 2043 - 2047
[2] Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for d = k+1, k+2, k+3
Vajha, Myna
Babu, Balaji Srinivasan
Kumar, P. Vijay
2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 2376 - 2380
[3] A Tight Lower Bound on the Sub-Packetization Level of Optimal-Access MSR and MDS Codes
Balaji, S. B.
Kumar, P. Vijay
2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 2381 - 2385
[4] Lower Bounds on the Sub-Packetization Level of MSR Codes and Characterizing Optimal-Access MSR Codes Achieving the Bound
Balaji, S. B.
Vajha, Myna
Kumar, P. Vijay
IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (10) : 6452 - 6471
[5] MSR Codes With Linear Field Size and Smallest Sub-Packetization for Any Number of Helper Nodes
Li, Guodong
Wang, Ningning
Hu, Sihuang
Ye, Min
IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (11) : 7790 - 7806
[6] Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization
Ye, Min
Barg, Alexander
IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (10) : 6307 - 6317
[7] An Exponential Lower Bound on the Sub-Packetization of MSR Codes
Alrabiah, Omar
Guruswami, Venkatesan
PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 979 - 985
[8] An Alternate Construction of an Access-Optimal Regenerating Code with Optimal Sub-Packetization Level
Agarwal, Gaurav Kumar
Sasidharan, Birenjith
Kumar, P. Vijay
2015 TWENTY FIRST NATIONAL CONFERENCE ON COMMUNICATIONS (NCC), 2015,
[9] Toward Lower Repair Bandwidth and Optimal Repair Complexity of Piggybacking Codes With Small Sub-Packetization
Jiang, Zhengyi
Shi, Hao
Huang, Zhongyi
Bai, Bo
Zhang, Gong
Hou, Hanxu
IEEE TRANSACTIONS ON COMMUNICATIONS, 2024, 72 (09) : 5279 - 5289
[10] Systematic Construction of MDS Codes with Small Sub-packetization Level and Near Optimal Repair Bandwidth
Li, Jie
Tang, Xiaohu
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 1067 - 1071

← 1 2 3 4 5 →