Zigzag Codes: MDS Array Codes With Optimal Rebuilding

DOI10.1109/TIT.2012.2227110MaRDI QIDQ2989370zbMATH OpenFDO

Authors Itzhak Tamo, Zhiying Wang, Jehoshua Bruck

Publication date 8 June 2017

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

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

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Linear codes (general theory) (94B05)

Abstract: MDS array codes are widely used in storage systems to protect data against erasures. We address the emph{rebuilding ratio} problem, namely, in the case of erasures, what is the fraction of the remaining information that needs to be accessed in order to rebuild emph{exactly} the lost information? It is clear that when the number of erasures equals the maximum number of erasures that an MDS code can correct then the rebuilding ratio is 1 (access all the remaining information). However, the interesting and more practical case is when the number of erasures is smaller than the erasure correcting capability of the code. For example, consider an MDS code that can correct two erasures: What is the smallest amount of information that one needs to access in order to correct a single erasure? Previous work showed that the rebuilding ratio is bounded between 1/2 and 3/4, however, the exact value was left as an open problem. In this paper, we solve this open problem and prove that for the case of a single erasure with a 2-erasure correcting code, the rebuilding ratio is 1/2. In general, we construct a new family of $r$-erasure correcting MDS array codes that has optimal rebuilding ratio of $fracer$ in the case of $e$ erasures, $1leeler$. Our array codes have efficient encoding and decoding algorithms (for the case $r=2$ they use a finite field of size 3) and an optimal update property.

Recommendations

• Zigzag decodable codes: linear-time erasure codes with applications to data storage
• Binary MDS Array Codes With Optimal Repair
• Optimal Rebuilding of Multiple Erasures in MDS Codes
• Zigzag codes and concatenated zigzag codes
• Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth
• On coding morphisms for zigzag codes
• Zig-zag and replacement product graphs and LDPC codes
• Low-Rate Repeat-Zigzag-Hadamard Codes
• A New Design of Binary MDS Array Codes With Asymptotically Weak-Optimal Repair
• X-code: MDS array codes with optimal encoding

Cited in

(18)

• Architecture-aware coding for distributed storage: repairable block failure resilient codes
• A new piggybacking design for systematic MDS storage codes
• Self-repairing codes
• Zigzag decodable codes: linear-time erasure codes with applications to data storage
• Irregular MDS Array Codes
• Zigzag codes and concatenated zigzag codes
• Binary MDS Array Codes With Optimal Repair
• Codes for Distributed Storage
• A class of minimum storage cooperative regenerating codes with low access property
• MDS array codes with efficient repair and small sub-packetization level
• Constructing leakage-resilient Shamir's secret sharing: over composite order fields
• Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing
• Physical-bit leakage resilience of linear code-based secret sharing
• New centralized multi-node repair schemes for distributed storage
• Construction of binary cooperative MSR codes with multiple repair degrees
• A new repair-efficient piggybacking design for systematic nodes
• Distributed repairing multiple erasures in Reed-Solomon codes
• (1+)-optimal MDS codes: contacting any set of helper nodes smaller than n-1

This page was built for publication: Zigzag Codes: MDS Array Codes With Optimal Rebuilding

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