The key equation for one-point codes and efficient error evaluation
From MaRDI portal
Publication:1602655
DOI10.1016/S0022-4049(01)00074-3zbMath1009.94015OpenAlexW2103743614MaRDI QIDQ1602655
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
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Extension of the Berlekamp-Massey algorithm to N dimensions
- Algebraic function fields and codes
- Fast decoding of codes from algebraic plane curves
- Decoding geometric Goppa codes using an extra place
- Decoding algebraic-geometric codes up to the designed minimum distance
- Achieving the designed error capacity in decoding algebraic-geometric codes
- The n-dimensional key equation and a decoding application
- Decoding of Hermitian codes: the key equation and efficient error evaluation
- A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes
- Determination of error values for algebraic-geometry codes and the Forney formula
- Efficient Forney functions for decoding AG codes
- Decoding geometric Goppa codes up to designed minimum distance by solving a key equation in a ring
- Decoding of codes defined by a single point on a curve
- Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
- A generalized Forney formula for algebraic-geometric codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The key equation for one-point codes and efficient error evaluation
