Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
DOI10.1007/S10623-009-9317-8zbMATH Open1184.94276OpenAlexW2081879618MaRDI QIDQ849367FDOQ849367
Nathan Drake, Gretchen L. Matthews
Publication date: 25 February 2010
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-009-9317-8
Finite fields (field-theoretic aspects) (12E20) Polynomials in general fields (irreducibility, etc.) (12E05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)
Cites Work
- List decoding of algebraic-geometric codes
- Algebraic function fields and codes
- Title not available (Why is that?)
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Decoding of Reed Solomon codes beyond the error-correction bound
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- ALGEBRAICO-GEOMETRIC CODES
- Title not available (Why is that?)
- Title not available (Why is that?)
- On representations of algebraic-geometry codes
- Parameter choices on Guruswami-Sudan algorithm for polynomial reconstruction
- Limits to list decoding Reed-Solomon codes
Cited In (3)
Recommendations
- Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds 👍 👎
- Efficient list decoding of a class of algebraic-geometry codes 👍 👎
- Gröbner basis approach to list decoding of algebraic geometry codes 👍 👎
- Title not available (Why is that?) 👍 👎
- A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound 👍 👎
- Minimum Distance Decoding of General Algebraic Geometry Codes via Lists 👍 👎
- Algebraic geometry codes with good asymptotic parameters 👍 👎
- Title not available (Why is that?) 👍 👎
- A Note on the Generalisation of the Guruswami–Sudan List Decoding Algorithm to Reed–Muller Codes 👍 👎
- List decoding of algebraic-geometric codes 👍 👎
This page was built for publication: Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q849367)
