An exposition of recent list-size bounds of FRS Codes

February 20, 2025 · The Ethereal · 🏛 Electron. Colloquium Comput. Complex.

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Abhibhav Garg, Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Ashutosh Shankar arXiv ID 2502.14358 Category cs.CC: Computational Complexity Cross-listed cs.IT, math.CO Citations 3 Venue Electron. Colloquium Comput. Complex. Last Checked 2 months ago

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).