2020/01/20 by Zitan Chen, Min Ye, Chen, Zitan +3
Computer Science · #Advanced Data Storage Technologies #Caching and Content Delivery #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.2001.07189
openalex publication_date 2020/01/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
Recently Reed-Solomon (RS) codes were shown to possess a repair scheme that supports repair of failed nodes with optimal repair bandwidth. In this paper, we extend this result in two directions. First, we propose a new repair scheme for the RS codes constructed in [Tamo-Ye-Barg, \em IEEE Transactions on Information Theory, vol. 65, May 2019] and show that our new scheme is robust to erroneous information provided by the helper nodes while maintaining the optimal repair bandwidth. Second, we construct a new family of RS codes with optimal access for the repair of any single failed node. We also show that the constructed codes can accommodate both features, supporting optimal-access repair with optimal error-correction capability. Going beyond RS codes, we also prove that any scalar MDS code with optimal repair bandwidth allows for a repair scheme with optimal access property.