List-decodability with large radius for Reed-Solomon codes

Asaf Ferber, Matthew Kwan, Lisa Sauermann. List-decodability with large radius for Reed-Solomon codes. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022. pages 720-726, IEEE, 2021. [doi]

@inproceedings{FerberKS21,
  title = {List-decodability with large radius for Reed-Solomon codes},
  author = {Asaf Ferber and Matthew Kwan and Lisa Sauermann},
  year = {2021},
  doi = {10.1109/FOCS52979.2021.00075},
  url = {https://doi.org/10.1109/FOCS52979.2021.00075},
  researchr = {https://researchr.org/publication/FerberKS21},
  cites = {0},
  citedby = {0},
  pages = {720-726},
  booktitle = {62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022},
  publisher = {IEEE},
  isbn = {978-1-6654-2055-6},
}