List-decodability with large radius for Reed-Solomon codes

DOI10.1109/FOCS52979.2021.00075MaRDI QIDQ6943475zbMATH OpenFDO

Authors Asaf Ferber, Matthew Kwan, Lisa Sauermann

Publication date 13 August 2025

Full work available at URL https://doi.org/10.1109/FOCS52979.2021.00075

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06)

Cited in

(1)

• Random Reed-Solomon codes achieve the half-singleton bound for insertions and deletions over linear-sized alphabets

This page was built for publication: List-decodability with large radius for Reed-Solomon codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6943475)