The key equation for one-point codes and efficient error evaluation

DOI10.1016/S0022-4049(01)00074-3MaRDI QIDQ1602655zbMATH OpenOpenAlexFDO

Authors Michael E. O'Sullivan

Publication date 24 June 2002

Published in Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0022-4049(01)00074-3

zbMATH Keywords

iterative algorithmReed-Solomon codessyndromeone-point codeserror evaluator polynomialGröbner basis

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• Decoding of Hermitian codes: the key equation and efficient error evaluation
• On Koetter's algorithm and the computation of error values
• On the key equation
• scientific article; zbMATH DE number 1276822
• A generalized Forney formula for algebraic-geometric codes

Cites work

• scientific article; zbMATH DE number 125897 (Why is no real title available?)
• scientific article; zbMATH DE number 125903 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 721912 (Why is no real title available?)
• scientific article; zbMATH DE number 1472128 (Why is no real title available?)
• A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes
• A generalized Forney formula for algebraic-geometric codes
• Achieving the designed error capacity in decoding algebraic-geometric codes
• Algebraic function fields and codes
• Decoding algebraic-geometric codes up to the designed minimum distance
• Decoding geometric Goppa codes up to designed minimum distance by solving a key equation in a ring
• Decoding geometric Goppa codes using an extra place
• Decoding of Hermitian codes: the key equation and efficient error evaluation
• Decoding of codes defined by a single point on a curve
• Determination of error values for algebraic-geometry codes and the Forney formula
• Efficient Forney functions for decoding AG codes
• Extension of the Berlekamp-Massey algorithm to N dimensions
• Fast decoding of codes from algebraic plane curves
• Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
• The n-dimensional key equation and a decoding application

Cited in

(2)

• One-point Klein codes and their serial-in-serial-out systematic encoding
• Decoding of Hermitian codes: the key equation and efficient error evaluation

This page was built for publication: The key equation for one-point codes and efficient error evaluation

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