Fast decoding of codes from algebraic curves

DOI10.1109/18.272487MaRDI QIDQ4307298zbMATH OpenOpenAlexFDO

Authors Carsten Dahl

Publication date 4 October 1994

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

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

zbMATH Keywords

algebraic geometry codesfast decoding

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Recommendations

• Fast decoding of codes from algebraic plane curves
• Fast Decoding of Multipoint Codes from Algebraic Curves
• Fast Decoding of Dual Multipoint Codes From Algebraic Curves Up to the Kirfel–Pellikaan Bound
• scientific article; zbMATH DE number 5529001
• scientific article; zbMATH DE number 1426185
• scientific article; zbMATH DE number 417878
• Constructing codes from algebraic curves
• On a decoding algorithm for codes on maximal curves
• scientific article; zbMATH DE number 1104924
• scientific article; zbMATH DE number 1512349

Cited in

(2)

• Fast unique decoding of plane AG codes
• Improved evaluation codes defined by plane valuations

This page was built for publication: Fast decoding of codes from algebraic curves

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