On Koetter's Algorithm and the Computation of Error Values

Designs, Codes, and Cryptography

Volumn 31, Issue 2, 2004, Pages 169-188

  O'Sullivan, Michael E ^a  

^a SAN DIEGO STATE UNIVERSITY   (United States)

Author keywords

Algebraic geometry codes; Error evaluation; Key equation

Indexed keywords

ALGEBRAIC GEOMETRY CODES; ERROR EVALUATION; KEY EQUATION;

ERROR ANALYSIS; ERROR CORRECTION; GEOMETRY; MATHEMATICAL MODELS; POLYNOMIALS; SET THEORY; THEOREM PROVING;

ALGORITHMS;

EID: 1242352553     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:DESI.0000012445.67356.7a     Document Type: Article

References (19)

1. D. Ehrhard, Achieving the designed error capacity in decoding algebraic-geometric codes, IEEE Trans. Inform. Theory, Vol. 39, No. 3 (1993) pp. 743-751.
2. D. Ehrhard, Decoding algebraic-geometric codes by solving a key equation, In Proc. AGCT-3, Luminy 1991, Lect. Notes in Mathematics, Vol. 1518, Springer, Berlin (1992) pp. 18-25.
3. G. L. Feng and T. R. N. Rao, Decoding algebraic-geometry codes up to the designed minimum distance, IEEE Trans. Inform. Theory, Vol. 39, No. 1 (1993) pp. 37-45.
4. J. P. Hansen, H. E. Jensen and R. Koetter, Determination of error values for algebraic geometry codes and the Forney formula, IEEE Trans. Inform. Theory, Vol. 44, No. 5 (1998) pp. 1881-1886.
5. T. Høholdt, R. Pellikaan and J. H. van Lint, Algebraic geometry codes, In (W. C. Huffmann and V. Pless eds.), Handbook of Coding Theory, Elsevier (1998) pp. 871-961.
6. J. Justesen, K. Larsen, H. E. Jensen and T. Høholdt, Fast decoding of codes from algebraic plane curves, IEEE Trans. Inform. Theory, Vol. 38, No. 1 (1992) pp. 111-119.
7. R. Koetter, A formula for the determination of error values for Hermitian codes, In Proc. IEEE 1997 International Symposium on Information Theory, Ulm, Germany, p. 382.
8. R. Koetter, A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes, IEEE Trans. Inform. Theory, Vol. 44, No. 4 (1998) pp. 1353-1368.
9. R. Koetter, On the determination of error values for codes from a class of maximal curves, In Proc. 35th Allerton Conf. on Communication, Control and Computing, University of Illinois (1997) pp. 44-53.
10. S. Lang, Introduction to Algebraic Geometry, Interscience Tracts in Pure and Applied Mathematics No. 5, Interscience Publishers, New York (1958).
11. S. Lang, Algebra, third ed., Addison-Wesley Pub. Co., Reading, Mass. (1993).
12. M. E. O'Sullivan, Decoding of codes defined by a single point on a curve, IEEE Trans. Inform. Theory, Vol. 41, No. 6 (1995) pp. 1709-1719.
13. M. E. O'Sullivan, The key equation for one-point codes, J. Pure Appl. Algebra, Vol. 169, No. 2-3 (2002) pp. 295-320.
14. M. E. O'Sullivan, New codes for the Berlekamp-Massey-Sakata algorithm, Finite Fields Applic., Vol. 7 (2001) pp. 293-317.
15. S. C. Porter, B.-Z. Shen and R. Pellikaan, Decoding geometric Goppa codes using an extra place, IEEE Trans. Inform. Theory, Vol. 38, No. 6 (1992) pp. 1663-1676.
16. S. Sakata, Extension of the Berlekamp-Massey algorithm to N dimensions, Information and Computation, Vol. 84 (1990) pp. 207-239.
17. S. Sakata, H. E. Jensen and T. Høholdt, Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound, IEEE Trans. Inform. Theory, Vol. 41, No. 6 (1992) pp. 1762-1768.
18. B.-Z. Shen and K. K. Tzeng, Decoding geometric Goppa codes up to the designed minimum distance by solving a key equation in a ring, IEEE Trans. Inform. Theory, Vol. 41, No. 6 (1995) pp. 1694-1702.
19. H. Stichtenoth, Algebraic Function Fields and Codes, Springer Verlag Universitext, Berlin (1993).