Guruswami-Sudan Decoding of Elliptic Codes Through Module Basis Reduction

DOI10.1109/TIT.2021.3109447MaRDI QIDQ5032568zbMATH OpenOpenAlexFDO

Authors Yunqi Wan, Li Chen, Fangguo Zhang

Publication date 17 February 2022

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

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

zbMATH Keywords

Guruswami-Sudan list decoding algorithmone-point elliptic codes

Mathematics Subject Classification ID

Decoding (94B35) Arithmetic codes (94B40)

Recommendations

• A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes
• A Note on the Generalisation of the Guruswami–Sudan List Decoding Algorithm to Reed–Muller Codes
• Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes
• On Elliptic Convolutional Goppa Codes
• On the decoding of cyclic codes using Gröbner bases
• Decoding Square-Free Goppa Codes Over $\BBF_{p}$
• scientific article; zbMATH DE number 1426185
• Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases
• scientific article; zbMATH DE number 5252301
• scientific article; zbMATH DE number 2222667

Cited in

(3)

• Sudan-decoding generalized geometric Goppa codes.
• A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes
• Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding

This page was built for publication: Guruswami-Sudan Decoding of Elliptic Codes Through Module Basis Reduction

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