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

Journal of Pure and Applied Algebra

Volumn 169, Issue 2-3, 2002, Pages 295-320

  O'Sullivan, Michael E ^a  

^a SAN DIEGO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037165604     PISSN: 00224049     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-4049(01)00074-3     Document Type: Article

References (23)

1. The n-dimensional key equation and a decoding application
2. Decoding algebraic-geometric codes by solving a key equation
3. Achieving the designed error capacity in decoding algebraic-geometric codes
4. Decoding algebraic-geometric codes up to the designed minimum distance
5. Determination of error values for algebraic geometry codes and the Forney formula
6. Algebraic geometry codes
7. Fast decoding of codes from algebraic plane curves
8. A formula for the determination of error values for Hermitian codes
9. A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes
10. On the determination of error values for codes from a class of maximal curves
11. A generalized Forney formula for algebraic-geometric codes
12. Efficient Forney functions for decoding AG codes
13. The Theory of Error-Correcting Codes
14. Decoding of codes defined by a single point on a curve
15. Decoding of Hermitian codes beyond the minimum distance bound
16. Decoding of Hermitian codes: The key equation and efficient error evaluation
17. Decoding geometric Goppa codes using an extra place
18. Extension of the Berlekamp-Massey algorithm to N dimensions
19. Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
20. On encoding and decoding of the codes from Hermitian curves
21. Decoding geometric Goppa codes up to the designed minimum distance by solving a key equation in a ring
22. Algebraic Function Fields and Codes
23. On the true minimum distance of Hermitian codes