Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes

DOI10.1007/S10623-009-9317-8MaRDI QIDQ849367zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

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)

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
• scientific article; zbMATH DE number 1670663
• 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
• scientific article; zbMATH DE number 2222668
• A Note on the Generalisation of the Guruswami–Sudan List Decoding Algorithm to Reed–Muller Codes
• List decoding of algebraic-geometric codes

Cites work

• scientific article; zbMATH DE number 41323 (Why is no real title available?)
• scientific article; zbMATH DE number 1284423 (Why is no real title available?)
• scientific article; zbMATH DE number 1488179 (Why is no real title available?)
• A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
• ALGEBRAICO-GEOMETRIC CODES
• Algebraic function fields and codes
• Decoding of Reed Solomon codes beyond the error-correction bound
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Limits to list decoding Reed-Solomon codes
• List decoding of algebraic-geometric codes
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• On representations of algebraic-geometry codes
• Parameter choices on Guruswami-Sudan algorithm for polynomial reconstruction

Cited in

(4)

• Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
• scientific article; zbMATH DE number 2081134 (Why is no real title available?)
• Parameter choices on Guruswami-Sudan algorithm for polynomial reconstruction
• Bounds on the List-Decoding Radius of Reed--Solomon 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)