Fast decoding of codes from algebraic plane curves

DOI10.1109/18.108255zbMath0745.94019OpenAlexW2104379151MaRDI QIDQ3991394

Helge Elbrond Jensen, Tom Høholdt, Knud J. Larsen, Jørn Justesen

Publication date: 28 June 1992

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

Full work available at URL: https://orbit.dtu.dk/en/publications/c361cd4e-f23b-4481-ae2b-484c072621ce

zbMATH Keywords

algebraic geometry codesdecoding algorithmHermitian curves

Mathematics Subject Classification ID

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

Related Items (7)

On the evaluation codes given by simple \(\delta \)-sequences ⋮ Evaluation codes defined by finite families of plane valuations at infinity ⋮ On the subfield subcodes of Hermitian codes ⋮ Gröbner basis approach to list decoding of algebraic geometry codes ⋮ On quasilinear-time complexity theory ⋮ Improved evaluation codes defined by plane valuations ⋮ The key equation for one-point codes and efficient error evaluation

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