Optimal Busy-Node Repair of (k+4,k,4) MDS Codes With Small Sub-Packetization Level

被引:0
|
作者
Rui, Jiayi [1 ]
Huang, Qin [1 ]
Han, Yunghsiang S. [2 ]
Wu, Ting-Yi [3 ]
机构
[1] Beihang Univ, Sch Elect & Informat Engn, Beijing 100191, Peoples R China
[2] Univ Elect Sci & Technol China, Shenzhen Inst Adv Study, Chengdu 610056, Peoples R China
[3] Huawei Technol Co Ltd, Cent Res Inst, Theory Lab, Labs 2012, Shenzhen 518129, Peoples R China
基金
中国国家自然科学基金;
关键词
Maintenance engineering; Symbols; Bandwidth; Codes; Industries; Indexes; Generators; Distributed storage system; busy-node repair; optimal access; small sub-packetization; bandwidth;
D O I
10.1109/LCOMM.2023.3241425
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Maximum distance separable array codes with small sub-packetization level (MDS-SSL) are of practical importance in distributed storage systems. This letter addresses their repair of a single failed node in the case that there exists a busy node during the repair. Additional check relations among codeword symbols excluding those in the busy node are formed to compensate for the absence of information. Then, it allows us to repair the failed node without symbols in the busy node. A lower bound of the busy-node repair bandwidth is derived for (k + 4, k, 4) MDS-SSL codes, consisting of four groups of nodes. It indicates that its achievability requires a cubic constraint among elements in the parity-check matrix. Then, an explicit busy-node repair scheme is proposed to achieve a lower bound in the case of the failed node and the busy node being in different groups.
引用
收藏
页码:1080 / 1084
页数:5
相关论文
共 21 条
  • [1] 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
  • [2] 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
  • [3] 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
  • [4] An Explicit Construction of Systematic MDS Codes with Small Sub-packetization for All-Node Repair
    Kralevska, Katina
    Gligoroski, Danilo
    2018 16TH IEEE INT CONF ON DEPENDABLE, AUTONOM AND SECURE COMP, 16TH IEEE INT CONF ON PERVAS INTELLIGENCE AND COMP, 4TH IEEE INT CONF ON BIG DATA INTELLIGENCE AND COMP, 3RD IEEE CYBER SCI AND TECHNOL CONGRESS (DASC/PICOM/DATACOM/CYBERSCITECH), 2018, : 1080 - 1084
  • [5] 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
  • [6] 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
  • [7] 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
  • [8] 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
  • [9] 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
  • [10] A New Cooperative Repair Scheme With k+1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization
    Liu, Yajuan
    Cai, Han
    Tang, Xiaohu
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (05) : 2820 - 2829