Repairing reed-solomon codes with two erasures

  title={Repairing reed-solomon codes with two erasures},
  author={Son Hoang Dau and Iwan M. Duursma and Han Mao Kiah and Olgica Milenkovic},
  journal={2017 IEEE International Symposium on Information Theory (ISIT)},
Despite their exceptional error-correcting properties, Reed-Solomon (RS) codes have been overlooked in distributed storage applications due to the common belief that they have poor repair bandwidth: A naive repair approach would require the whole file to be reconstructed in order to recover a single erased codeword symbol. In a recent work, Guruswami and Wootters (STOC'16) proposed a single-erasure repair method for RS codes that achieves the optimal repair bandwidth amongst all linear encoding… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 3 times over the past 90 days. VIEW TWEETS
7 Citations
12 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 12 references

and S

  • P. Gopalan, C. Huang, H. Simitci
  • Yekhanin, “On the locality of codeword symbols…
  • 2012
1 Excerpt

and K

  • A. Dimakis, P. Godfrey, Y. Wu, M. Wainwright
  • Ramchandran, “Network coding for distributed…
  • 2010
2 Excerpts

Similar Papers

Loading similar papers…