Optimal repair schemes for some families of full-length reed-solomon codes
Authors:
- 1 June 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 346-350
Abstract
Reed-Solomon codes have found many applications in practical storage systems, but were until recently considered unsuitable for distributed storage applications due to the widely-held belief that they have poor repair bandwidth. The work of Guruswami and Wootters (STOC'16) has shown that one can actually perform bandwidth-efficient linear repair with Reed-Solomon codes: When the codes are over the field F q t and the number of parities r ≥ q s , where (t - s) divides t, there exists a linear scheme that achieves a repair bandwidth of (n - 1)(t - s) logg q bits. We extend this result by showing the existence of such a linear repair scheme for every 1 ≤ s <; t. Moreover, our new schemes are optimal among all linear repair schemes for Reed-Solomon codes when n = q t and r = q s . Additionally, we improve the lower bound on the repair bandwidth for Reed-Solomon codes, also established in the work of Guruswami and Wootters.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth2016
- Repairing Reed-solomon codes2016
- A Repair Framework for Scalar MDS CodesIEEE Journal on Selected Areas in Communications, 2014
- On the Locality of Codeword SymbolsIEEE Transactions on Information Theory, 2012
- Locally repairable codes2012
- On codes for optimal rebuilding access2011
- A Survey on Network Codes for Distributed StorageProceedings of the IEEE, 2011
- Network Coding for Distributed Storage SystemsIEEE Transactions on Information Theory, 2010
- Basic Structures of Function Field Arithmetic1996
- Polynomial Codes Over Certain Finite FieldsJournal of the Society for Industrial and Applied Mathematics, 1960