Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization

Venkatesan Guruswami, Haotian Jiang. Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization. In IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, July 7-12, 2019. pages 1077-1081, IEEE, 2019. [doi]

@inproceedings{GuruswamiJ19,
  title = {Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization},
  author = {Venkatesan Guruswami and Haotian Jiang},
  year = {2019},
  doi = {10.1109/ISIT.2019.8849719},
  url = {https://doi.org/10.1109/ISIT.2019.8849719},
  researchr = {https://researchr.org/publication/GuruswamiJ19},
  cites = {0},
  citedby = {0},
  pages = {1077-1081},
  booktitle = {IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, July 7-12, 2019},
  publisher = {IEEE},
  isbn = {978-1-5386-9291-2},
}