A Note on Bandwidth-Optimal Repair Scheme for Reed-Solomon Codes With Low Repair Locality

被引：0
|
作者：
Lin, Xing [1 ]
机构：
[1] Southwest Jiaotong Univ, CSNMT Int Coop Res Ctr MoST, Informat Coding & Transmiss Key Lab Sichuan Prov, Chengdu 611756, Peoples R China
来源：
IEEE COMMUNICATIONS LETTERS | 2023年 / 27卷 / 11期
关键词：
Distributed storage systems; Reed-Solomon codes; single symbol repair; bandwidth-optimal linear repair scheme; SMALL SUB-PACKETIZATION; DISTRIBUTED STORAGE; OPTIMAL-ACCESS; MDS CODES; CONSTRUCTIONS; MSR;
D O I：
10.1109/LCOMM.2023.3319653
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
Reed-Solomon codes can be regarded as polynomials over a finite field GF(q(t)) evaluated at a set of points, where t is referred to as the sub-packetization size. In this letter, for the small sub-packetization size regime, we show a bandwidth-optimal linear repair scheme of single failed symbol for Reed-Solomon codes with repair locality smaller than n - 1 for the first time, where repair locality refers to the number of the surviving symbols involved in the repair and n means the code length.
引用
收藏
页码：2924 / 2927
页数：4
相关论文
共 50 条
  • [1] Nonlinear Repair of Reed-Solomon Codes
    Con, Roni
    Tamo, Itzhak
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (08) : 5165 - 5177
  • [2] Enabling Optimal Access and Error Correction for the Repair of Reed-Solomon Codes
    Chen, Zitan
    Ye, Min
    Barg, Alexander
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (12) : 7439 - 7456
  • [3] The Repair Problem for Reed-Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size
    Tamo, Itzhak
    Ye, Min
    Barg, Alexander
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (05) : 2673 - 2695
  • [4] An Improved Cooperative Repair Scheme for Reed-Solomon Codes
    Zhang, Yaqian
    Zhang, Zhifang
    ISCIT 2019: PROCEEDINGS OF 2019 19TH INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS AND INFORMATION TECHNOLOGIES (ISCIT), 2019, : 525 - 530
  • [5] 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
  • [6] 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
  • [7] Cooperative Repair of Reed-Solomon Codes via Linearized Permutation Polynomials
    Xu, Jingke
    Zhang, Yaqian
    Wang, Ke
    Zhang, Zhifang
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (07) : 4747 - 4758
  • [8] Optimal repair of Reed-Solomon codes: Achieving the cut-set bound
    Tamo, Itzhak
    Ye, Min
    Barg, Alexander
    2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2017, : 216 - 227
  • [9] A Formula for the I/O Cost of Linear Repair Schemes and Application to Reed-Solomon Codes
    Liu, Zhongyan
    Zhang, Zhifang
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2025, 73 (01) : 67 - 76
  • [10] Optimal Repair Schemes for Some Families of Full-Length Reed-Solomon Codes
    Hoang Dau
    Milenkovic, Olgica
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 346 - 350
12345