An Explicit Construction of Systematic MDS Codes with Small Sub-packetization for All-Node Repair

被引：0
|
作者：
Kralevska, Katina [1 ]
Gligoroski, Danilo [1 ]
机构：
[1] Norwegian Univ Sci & Technol, NTNU, Dept Informat Secur & Commun Technol, Trondheim, Norway
来源：
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年
关键词：
Explicit; systematic; MDS; MSR; small sub-packetization; all-node repair; access-optimal;
D O I：
10.1109/DASC/PiCom/DataCom/CyberSciTec.2018.00066
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
An explicit construction of systematic MDS codes, called HashTag+ codes, with arbitrary sub-packetization level for all-node repair is proposed. It is shown that even for small sub-packetization levels, HashTag+ codes achieve the optimal MSR point for repair of any parity node, while the repair bandwidth for a single systematic node depends on the sub-packetization level. Compared to other codes in the literature, HashTag+ codes provide from 20% to 40% savings in the average amount of data accessed and transferred during repair.
引用
收藏
页码：1080 / 1084
页数：5
相关论文
共 22 条
  • [1] 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
  • [2] 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
  • [3] 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
  • [4] 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
  • [5] ε-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
  • [6] 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
  • [7] Piggybacking plus Codes: MDS Array Codes with Linear Sub-Packetization to Achieve Lower Repair Bandwidth
    Shi, Hao
    Jiang, Zhengyi
    Huang, Zhongyi
    Bai, Bo
    Zhang, Gong
    Hou, Hanxu
    IEEE CONFERENCE ON GLOBAL COMMUNICATIONS, GLOBECOM, 2023, : 7351 - 7356
  • [8] 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
  • [9] 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
  • [10] 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
123