Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes

DOI10.1109/18.945273MaRDI QIDQ4544702zbMATHOpenAlexFDO

Authors Xin-Wen Wu, Paul Siegel

Publication date 4 August 2002

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

Full work available at URL http://hdl.handle.net/10072/55895

zbMATH Keywords

function fieldslist decodingroot-finding algorithmalgebraic-geometric codes

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Numerical computation of solutions to single equations (65H05) 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
• A Root-Finding Algorithm for List Decoding of Reed–Muller Codes
• scientific article; zbMATH DE number 1670663
• Improved decoding of Reed-Solomon and algebraic-geometry codes

Cited in

(8)

• On representations of algebraic-geometry codes
• ECC\(^2\): error correcting code and elliptic curve based cryptosystem
• Efficient list decoding of a class of algebraic-geometry codes
• Root lifting techniques and applications to list decoding
• Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders
• List decoding of Hermitian codes using Gröbner bases
• Polynomial root finding over local rings and application to error correcting codes
• A Root-Finding Algorithm for List Decoding of Reed–Muller Codes

This page was built for publication: Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes

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