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

DOI10.1109/18.825814zbMath0998.94036OpenAlexW2165503831MaRDI QIDQ4503544

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

decodingHermitian codessyndromekey equationerror evaluator polynomiallocator polynomials

Mathematics Subject Classification ID

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

Related Items (6)

On the geometry of Hermitian one-point codes ⋮ Minimum-weight codewords of the Hermitian codes are supported on complete intersections ⋮ A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm ⋮ Hermitian codes and complete intersections ⋮ Simultaneous rational function reconstruction with errors: handling multiplicities and poles ⋮ The key equation for one-point codes and efficient error evaluation

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