|Repair of RS codes with optimal access and error correction
|Zitan Chen, Min Ye, Alexander Barg, University of Maryland, United States
|M.2: Codes for Distributed Storage II
|Coding for Storage and Memories
|Click here to download the manuscript
|Click here to watch in the Virtual Symposium
|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.