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

Hoang Dau, Olgica Milenkovic. Optimal repair schemes for some families of full-length reed-solomon codes. In 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, June 25-30, 2017. pages 346-350, IEEE, 2017. [doi]

@inproceedings{DauM17,
  title = {Optimal repair schemes for some families of full-length reed-solomon codes},
  author = {Hoang Dau and Olgica Milenkovic},
  year = {2017},
  doi = {10.1109/ISIT.2017.8006547},
  url = {https://doi.org/10.1109/ISIT.2017.8006547},
  researchr = {https://researchr.org/publication/DauM17},
  cites = {0},
  citedby = {0},
  pages = {346-350},
  booktitle = {2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, June 25-30, 2017},
  publisher = {IEEE},
  isbn = {978-1-5090-4096-4},
}