2025/02/20 by Abhibhav Garg, Prahladh Harsha, Garg, Abhibhav +7 · 1 voice · 1 citation
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Coding theory and cryptography #cs.CC #cs.IT #graph theory and CDMA systems #math.CO
paper · pdf · doi:10.48550/arxiv.2502.14358
openalex publication_date 2025/02/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In the last year, there have been some remarkable improvements in the combinatorial list-size bounds of Folded Reed Solomon codes and multiplicity codes. Starting from the work on Kopparty, Ron-Zewi, Saraf and Wootters (SIAM J. Comput. 2023) (and subsequent simplifications due to Tamo (IEEE Trans. Inform. Theory 2024), we have had dramatic improvements in the list-size bounds of FRS codes due to Srivastava (SODA 2025) and Chen & Zhang (STOC 2025). In this note, we give a short exposition of these three results (Tamo, Srivastava and Chen-Zhang).