Repairing Multiple Failures for Scalar MDS Codes

DOI10.1109/TIT.2018.2876542MaRDI QIDQ5223960zbMATH OpenOpenAlexFDO

Authors Jay Mardia, Burak Bartan, Mary Wootters

Publication date 19 July 2019

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

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Abstract: In distributed storage, erasure codes -- like Reed-Solomon Codes -- are often employed to provide reliability. In this setting, it is desirable to be able to repair one or more failed nodes while minimizing the repair bandwidth. In this work, motivated by Reed-Solomon codes, we study the problem of repairing multiple failed nodes in a scalar MDS code. We extend the framework of (Guruswami and Wootters, 2017) to give a framework for constructing repair schemes for multiple failures in general scalar MDS codes, in the centralized repair model. We then specialize our framework to Reed-Solomon codes, and extend and improve upon recent results of (Dau et al., 2017).

Cited in

(6)

• Codes for Distributed Storage
• Binary MDS Array Codes With Optimal Repair
• Modified Low-Density MDS Array Codes for Tolerating Double Disk Failures in Disk Arrays
• Constructing locally leakage-resilient linear secret-sharing schemes
• Determinant Codes With Helper-Independent Repair for Single and Multiple Failures
• Codes Between MBR and MSR Points With Exact Repair Property

This page was built for publication: Repairing Multiple Failures for Scalar MDS Codes

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