Long MDS codes for optimal repair bandwidth
- 1 July 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1182-1186
Abstract
MDS codes are erasure-correcting codes that can correct the maximum number of erasures given the number of redundancy or parity symbols. If an MDS code has r parities and no more than r erasures occur, then by transmitting all the remaining data in the code one can recover the original information. However, it was shown that in order to recover a single symbol erasure, only a fraction of 1/r of the information needs to be transmitted. This fraction is called the repair bandwidth (fraction). Explicit code constructions were given in previous works. If we view each symbol in the code as a vector or a column, then the code forms a 2D array and such codes are especially widely used in storage systems. In this paper, we ask the following question: given the length of the column l, can we construct high-rate MDS array codes with optimal repair bandwidth of 1/r, whose code length is as long as possible? In this paper, we give code constructions such that the code length is (r + l)logr l.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Access vs. bandwidth in codes for storage2012
- Long MDS codes for optimal repair bandwidth2012
- Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code ConstructionsIEEE Transactions on Information Theory, 2011
- On codes for optimal rebuilding access2011
- Repair optimal erasure codes through hadamard designs2011
- MDS array codes with optimal rebuilding2011
- Exact-Repair MDS Code Construction Using Interference AlignmentIEEE Transactions on Information Theory, 2011
- Network Coding for Distributed Storage SystemsIEEE Transactions on Information Theory, 2010
- Minimum Repair Bandwidth for Exact Regeneration in Distributed Storage2010
- Explicit construction of optimal exact regenerating codes for distributed storage2009