Optimal repair schemes for some families of full-length reed-solomon codes

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 Fqt and the number of parities r ≥ qs, 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 = qt and r = qs. Additionally, we improve the lower bound on the repair bandwidth for Reed-Solomon codes, also established in the work of Guruswami and Wootters.

Original languageEnglish (US)
Title of host publication2017 IEEE International Symposium on Information Theory, ISIT 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages346-350
Number of pages5
ISBN (Electronic)9781509040964
DOIs
StatePublished - Aug 9 2017
Event2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany
Duration: Jun 25 2017Jun 30 2017

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Other

Other2017 IEEE International Symposium on Information Theory, ISIT 2017
CountryGermany
CityAachen
Period6/25/176/30/17

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Optimal repair schemes for some families of full-length reed-solomon codes'. Together they form a unique fingerprint.

Cite this