Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization

Minimum storage regenerating (MSR) codes are MDS codes which allow for recovery of any single erased symbol with optimal repair bandwidth, based on the smallest possible fraction of the contents downloaded from each of the other symbols. Recently, certain Reed- Solomon codes were constructed which are MSR. However, the sub-packetization of these codes is exponentially large, growing like nΩ(n) in the constant-rate regime. In this work, we study the relaxed notion of ϵ-MSR codes, which incur a factor of (1 + ϵ) higher than the optimal repair bandwidth, in the context of Reed-Solomon codes. We give constructions of constant-rate ϵ-MSR Reed-Solomon codes with polynomial sub-packetization of nO(l/ϵ) and thereby giving an explicit tradeoff between the repair bandwidth and sub-packetization.

[1]  Alexander Barg,et al.  Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization , 2016, IEEE Transactions on Information Theory.

[2]  Hamid Jafarkhani,et al.  A tradeoff between the sub-packetization size and the repair bandwidth for reed-solomon code , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[3]  Itzhak Tamo,et al.  Optimal Repair of Reed-Solomon Codes: Achieving the Cut-Set Bound , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[4]  Venkatesan Guruswami,et al.  Repairing Reed-Solomon Codes , 2015, IEEE Transactions on Information Theory.

[5]  Venkatesan Guruswami,et al.  MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth , 2017, IEEE Transactions on Information Theory.

[6]  Venkatesan Guruswami,et al.  MDS code constructions with small sub-packetization and near-optimal repair bandwidth , 2017, SODA 2017.

[7]  Venkatesan Guruswami,et al.  An exponential lower bound on the sub-packetization of MSR codes , 2019, Electron. Colloquium Comput. Complex..

[8]  Alexandros G. Dimakis,et al.  Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[9]  Dimitris S. Papailiopoulos,et al.  A repair framework for scalar MDS codes , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[10]  Hoang Dau,et al.  Optimal repair schemes for some families of full-length reed-solomon codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[11]  P. Vijay Kumar,et al.  An Explicit, Coupled-Layer Construction of a High-Rate MSR Code with Low Sub-Packetization Level, Small Field Size and All-Node Repair , 2016, ArXiv.

[12]  Han Mao Kiah,et al.  Repairing Reed-Solomon Codes With Multiple Erasures , 2016, IEEE Transactions on Information Theory.

[13]  A. Robert Calderbank,et al.  An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes , 2013, IEEE Transactions on Information Theory.

[14]  Kannan Ramchandran,et al.  A “Hitchhiker’s” Guide to Fast and Efficient Data Reconstruction in Erasure-coded Data Centers , 2014 .