Enabling Optimal Access and Error Correction for the Repair of Reed–Solomon Codes

DOI10.1109/TIT.2020.3017666zbMATH Open1457.94231arXiv2001.07189OpenAlexW3071276093MaRDI QIDQ5138906FDOQ5138906

Authors: Zitan Chen, Min Ye, Alexander Barg

Publication date: 4 December 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/2001.07189

zbMATH Keywords

Reed-Solomon (RS) codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Authentication, digital signatures and secret sharing (94A62)

Cited In (7)

This page was built for publication: Enabling Optimal Access and Error Correction for the Repair of Reed–Solomon Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138906)