The following publications are possibly variants of this publication:
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabetsVenkatesan Guruswami, Anindya C. Patthak. moc, 77(261):447-473, 2008. [doi]
- Optimal rate list decoding over bounded alphabets using algebraic-geometric codesVenkatesan Guruswami, Chaoping Xing. eccc, 27:172, 2020. [doi]
- Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric CodesVenkatesan Guruswami, Chaoping Xing. JACM, 69(2), 2022. [doi]
- Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabetsVenkatesan Guruswami, Chaoping Xing. eccc, 20:46, 2013. [doi]
- Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabetsVenkatesan Guruswami, Chaoping Xing. soda 2014: 1858-1866 [doi]
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabetsVenkatesan Guruswami, Piotr Indyk. stoc 2002: 812-821 [doi]
- On Representations of Algebraic-Geometric Codes for List DecodingVenkatesan Guruswami, Madhu Sudan. esa 2000: 244-255
- AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabetsOmar Alrabiah, Venkatesan Guruswami, Ray Li. eccc, TR23, 2023. [doi]
- AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabetsOmar Alrabiah, Venkatesan Guruswami, Ray Li. soda 2024: 1367-1378 [doi]