A fast decoding method of AG codes from Miura-Kamiya curves C_ab up to half the Feng-Rao bound

DOI10.1006/FFTA.1995.1006MaRDI QIDQ1344098zbMATH OpenOpenAlexFDO

Authors Y. Madelung, Shojiro Sakata, Jørn Justesen, Helge Elbrond Jensen, Tom Høholdt

Publication date 9 February 1995

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/ffta.1995.1006

zbMATH Keywords

algebraic- geometric codesBerlekamp-Massey algorithmfast decodingFeng-Rao algorithmFeng-Rao boundgeometric Goppa codesMiura-Kamiya curvesone-point codesSakata algorithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Computational aspects of algebraic curves (14Q05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Recommendations

• Fast unique decoding of plane AG codes
• List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
• Fast decoding of algebraic-geometric codes up to the designed minimum distance
• Fast erasure-and-error decoding of algebraic geometry codes up to the Feng-Rao bound
• Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound

Cited in

(6)

• On codes from norm-trace curves
• An improvement of the Feng-Rao bound for primary codes
• A sequence of one-point codes from a tower of function fields
• Feng-Rao decoding of primary codes
• Fast unique decoding of plane AG codes
• Aggregate error locator and error value computation in AG codes

This page was built for publication: A fast decoding method of AG codes from Miura-Kamiya curves \(C_{ab}\) up to half the Feng-Rao bound

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