An exposition of recent list-size bounds of FRS Codes
Computational Complexity
2025-02-21 v1 Information Theory
Combinatorics
math.IT
Abstract
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).
Keywords
Cite
@article{arxiv.2502.14358,
title = {An exposition of recent list-size bounds of FRS Codes},
author = {Abhibhav Garg and Prahladh Harsha and Mrinal Kumar and Ramprasad Saptharishi and Ashutosh Shankar},
journal= {arXiv preprint arXiv:2502.14358},
year = {2025}
}
Comments
14 pages