Technical Program

Paper Detail

Paper IDM.2.4
Paper Title Repair of RS codes with optimal access and error correction
Authors Zitan Chen, Min Ye, Alexander Barg, University of Maryland, United States
Session M.2: Codes for Distributed Storage II
Presentation Lecture
Track Coding for Storage and Memories
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
Abstract We address two aspects of the repair problem of Reed-Solomon codes. First, we propose a new repair scheme for the RS codes constructed in [Tamo-Ye-Barg, IEEE Trans. Inf. Theory, May 2019] which in addition to optimal repair bandwidth is also robust to erroneous information provided by the helper nodes. Next, we construct a new family of RS codes with optimal access for the repair of any single failed node. We also prove that any scalar MDS code with optimal repair bandwidth can be furnished with a repair scheme with the optimal access property.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!