On the NP-hardness of bounded distance decoding of Reed-Solomon codes

Venkata Gandikota, Badih Ghazi, Elena Grigorescu. On the NP-hardness of bounded distance decoding of Reed-Solomon codes. In IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14-19, 2015. pages 2904-2908, IEEE, 2015. [doi]

@inproceedings{GandikotaGG15,
  title = {On the NP-hardness of bounded distance decoding of Reed-Solomon codes},
  author = {Venkata Gandikota and Badih Ghazi and Elena Grigorescu},
  year = {2015},
  doi = {10.1109/ISIT.2015.7282988},
  url = {http://dx.doi.org/10.1109/ISIT.2015.7282988},
  researchr = {https://researchr.org/publication/GandikotaGG15},
  cites = {0},
  citedby = {0},
  pages = {2904-2908},
  booktitle = {IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14-19, 2015},
  publisher = {IEEE},
  isbn = {978-1-4673-7704-1},
}