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 条

[11] PMDS Array Codes With Small Sub-Packetization, Small Repair Bandwidth/Rebuilding Access
Li, Jie
Tang, Xiaohu
Hou, Hanxu
Han, Yunghsiang S.
Bai, Bo
Zhang, Gong
IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (03) : 1551 - 1566
[12] A Systematic Construction of MDS Codes With Small Sub-Packetization Level and Near-Optimal Repair Bandwidth
Li, Jie
Liu, Yi
Tang, Xiaohu
IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (04) : 2162 - 2180
[13] Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization
Guruswami, Venkatesan
Jiang, Haotian
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 1077 - 1081
[14] On the Sub-Packetization Size and the Repair Bandwidth of Reed-Solomon Codes
Li, Weiqi
Wang, Zhiying
Jafarkhani, Hamid
IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (09) : 5484 - 5502
[15] The Optimal Sub-Packetization of Linear Capacity-Achieving PIR Schemes With Colluding Servers
Zhang, Zhifang
Xu, Jingke
IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (05) : 2723 - 2735
[16] MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth
Rawat, Ankit Singh
Tamo, Itzhak
Guruswami, Venkatesan
Efremenko, Klim
IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (10) : 6506 - 6525
[17] MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth
Guruswami, Venkatesan
Rawat, Ankit Singh
PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 2109 - 2122
[18] Minimum Storage Partially Cooperative Regenerating Codes With Small Sub-Packetization
Liu, Yajuan
Wang, Yanyan
Cai, Han
Tang, Xiaohu
IEEE TRANSACTIONS ON COMMUNICATIONS, 2024, 72 (01) : 38 - 49
[19] MDS array codes with efficient repair and small sub-packetization level
Li, Lei
Yu, Xinchun
Ying, Chenhao
Chen, Liang
Dong, Yuanyuan
Luo, Yuan
DESIGNS CODES AND CRYPTOGRAPHY, 2024, 92 (11) : 3783 - 3798
[20] Optimal Busy-Node Repair of (k+4,k,4) MDS Codes With Small Sub-Packetization Level
Rui, Jiayi
Huang, Qin
Han, Yunghsiang S.
Wu, Ting-Yi
IEEE COMMUNICATIONS LETTERS, 2023, 27 (04) : 1080 - 1084

← 1 2 3 4 5 →