Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
1 Publication
2025 | Published | Conference Paper | IST-REx-ID: 19281 | 
Resch, N., Yuan, C., & Zhang, Y. (2025). Tight bounds on list-decodable and list-recoverable zero-rate codes. In 16th Innovations in Theoretical Computer Science Conference (Vol. 325). New York, NY, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2025.82
[Published Version]
View
| Files available
| DOI
| arXiv