An exposition of recent list-size bounds of FRS Codes
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929722239221760 |
|---|---|
| author | Garg, Abhibhav Harsha, Prahladh Kumar, Mrinal Saptharishi, Ramprasad Shankar, Ashutosh |
| author_facet | Garg, Abhibhav Harsha, Prahladh Kumar, Mrinal Saptharishi, Ramprasad Shankar, Ashutosh |
| contents | 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). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_14358 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An exposition of recent list-size bounds of FRS Codes Garg, Abhibhav Harsha, Prahladh Kumar, Mrinal Saptharishi, Ramprasad Shankar, Ashutosh Computational Complexity Information Theory Combinatorics 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). |
| title | An exposition of recent list-size bounds of FRS Codes |
| topic | Computational Complexity Information Theory Combinatorics |
| url | https://arxiv.org/abs/2502.14358 |