Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
From MaRDI portal
Publication:5429508
DOI10.1090/S0025-5718-07-02012-1zbMath1150.94013MaRDI QIDQ5429508
Anindya C. Patthak, Venkatesan Guruswami
Publication date: 30 November 2007
Published in: Mathematics of Computation (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Efficient List Decoding of Explicit Codes with Optimal Redundancy ⋮ On the Computation of Non-uniform Input for List Decoding on Bezerra-Garcia Tower ⋮ List decoding codes on Garcia-Stichtenoth tower using Gröbner basis
Cites Work
- Unnamed Item
- Algebraic function fields and codes
- On the asymptotic behaviour of some towers of function fields over finite fields
- Decoding of Reed Solomon codes beyond the error-correction bound
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Explicit capacity-achieving list-decodable codes
- Algebraic soft-decision decoding of reed-solomon codes
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- On representations of algebraic-geometry codes
- A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
This page was built for publication: Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
