Decoding of Hermitian codes: the key equation and efficient error evaluation

DOI10.1109/18.825814MaRDI QIDQ4503544zbMATH OpenOpenAlexFDO

Authors Michael E. O'Sullivan

Publication date 7 September 2000

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

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

zbMATH Keywords

decodingerror evaluator polynomialHermitian codeskey equationlocator polynomialssyndrome

Mathematics Subject Classification ID

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

Recommendations

• Syndrome decoding for Hermite codes with a Sugiyama-type algorithm
• The key equation for one-point codes and efficient error evaluation
• Fast decoding of codes from algebraic plane curves
• Hermitian codes as generalized Reed-Solomon codes
• scientific article; zbMATH DE number 721912

Cited in

(9)

• The key equation for one-point codes and efficient error evaluation
• Simultaneous rational function reconstruction with errors: handling multiplicities and poles
• Hermitian codes and complete intersections
• Minimum-weight codewords of the Hermitian codes are supported on complete intersections
• A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm
• Syndrome decoding for Hermite codes with a Sugiyama-type algorithm
• On the geometry of Hermitian one-point codes
• Fractional decoding of \(r\)-Hermitian codes
• Small-weight codewords of algebraic geometry codes

This page was built for publication: Decoding of Hermitian codes: the key equation and efficient error evaluation

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