Decoding of codes defined by a single point on a curve

DOI10.1109/18.476244zbMATH Open0863.94028OpenAlexW2154031544MaRDI QIDQ4880296FDOQ4880296

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

Recommendations

• On the decoding of algebraic-geometric codes
• On a decoding algorithm for codes on maximal curves
• Fast decoding of algebraic-geometric codes up to the designed minimum distance
• Fast decoding of codes from algebraic plane curves

zbMATH Keywords

decoding algorithmalgebraic geometry codesBerlekamp-Massey type algorithm

Mathematics Subject Classification ID

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

Cited In (12)

• The key equation for one-point codes and efficient error evaluation
• New codes for the Berlekamp-Massey-Sakata algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Aggregate error locator and error value computation in AG codes
• On the structure of order domains
• Title not available (Why is that?)
• Evaluation codes defined by finite families of plane valuations at infinity
• On a decoding algorithm for codes on maximal curves
• On the evaluation codes given by simple \(\delta \)-sequences
• Decoding of scroll codes
• The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting

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

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