Decoding of codes defined by a single point on a curve

DOI10.1109/18.476244zbMath0863.94028OpenAlexW2154031544MaRDI QIDQ4880296

Michael E. O'Sullivan

Publication date: 13 August 1996

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

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

zbMATH Keywords

algebraic geometry codesdecoding algorithmBerlekamp-Massey type algorithm

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 ⋮ Aggregate error locator and error value computation in AG codes ⋮ The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting ⋮ Evaluation codes defined by finite families of plane valuations at infinity ⋮ On the structure of order domains ⋮ New codes for the Berlekamp-Massey-Sakata algorithm ⋮ The key equation for one-point codes and efficient error evaluation

This page was built for publication: Decoding of codes defined by a single point on a curve