Minimum Distance Decoding of General Algebraic Geometry Codes via Lists

DOI10.1109/TIT.2010.2054670MaRDI QIDQ5281294zbMATH OpenOpenAlexFDO

Authors Nathan Drake, Gretchen L. Matthews

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2010.2054670

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Recommendations

• List decoding of algebraic-geometric codes
• Efficient list decoding of a class of algebraic-geometry codes
• scientific article; zbMATH DE number 1670663
• scientific article; zbMATH DE number 1441986
• Decoding algebraic-geometric codes up to the designed minimum distance
• Gröbner basis approach to list decoding of algebraic geometry codes
• New lower bounds for the minimum distance of generalized algebraic geometry codes
• Erasure List-Decodable Codes From Random and Algebraic Geometry Codes
• Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes
• Generalized minimum-distance decoding of Euclidean-space codes and lattices

Cited in

(1)

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

This page was built for publication: Minimum Distance Decoding of General Algebraic Geometry Codes via Lists

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281294)