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

DOI10.1007/s10623-009-9317-8zbMath1184.94276OpenAlexW2081879618MaRDI QIDQ849367

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

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Polynomials in general fields (irreducibility, etc.) (12E05) Finite fields (field-theoretic aspects) (12E20) Decoding (94B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic function fields and 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
• Parameter choices on Guruswami-Sudan algorithm for polynomial reconstruction
• Limits to list decoding Reed-Solomon codes
• ALGEBRAICO-GEOMETRIC 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
• 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