Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes
From MaRDI portal
Publication:4544702
DOI10.1109/18.945273zbMath1019.94031OpenAlexW2122115476MaRDI QIDQ4544702
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
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Numerical computation of solutions to single equations (65H05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Decoding (94B35)
Related Items (2)
ECC\(^2\): error correcting code and elliptic curve based cryptosystem ⋮ List decoding of Hermitian codes using Gröbner bases
This page was built for publication: Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes