Efficient Forney functions for decoding AG codes

IEEE Transactions on Information Theory

Volumn 45, Issue 1, 1999, Pages 260-265

  Leonard, Douglas A ^a  

^a AUBURN UNIVERSITY   (United States)

Author keywords

Algebraic geometric (ag) codes; Fglm algorithm; Forney formula; Gr bner bases

Indexed keywords

ALGEBRA; ALGORITHMS; DECODING; EFFICIENCY; ERROR ANALYSIS; GEOMETRY;

ALGEBRAIC-GEOMETRIC CODES;

CODES (SYMBOLS);

EID: 0032653414     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.746805     Document Type: Article

References (21)

1. D. Cox, J. Little, and D. O'Shea, Ideals, Varieties, and Algorithms. New York: Springer-Verlag, 1992.
2. C. Dahl, "Fast decoding of codes from algebraic curves," IEEE Trans. Inform. Theory, vol. 40, pp. 223-229, Jan. 1994.
3. I. Duursma, "Decoding codes from curves and cyclic codes," Ph.D. dissertation, Eindhoven Univ. Technol., Eindhoven, The Netherlands, Sept. 1993.
4. D. Ehrhard, "Decoding algebraic-geometric codes by solving a key equation, " in Proc. AGCT-3, H. Stichtenoth and M. Tsfasman, Eds., Springer L7NM 1518, 1992.
5. J. C. Faugère, P. Gianni, D. Lazard, and T. Mora, "Efficient computation of zero-dimensional Gröbner bases by change of ordering," J. Symb. Computat.. vol. 16, pp. 329-344, 1994.
6. G.-L. Feng and T. R. N. Rao, "Decoding of algebraic-geometric codes up to the designed minimum distance," IEEE Trans. Inform. Theory, vol. 39, pp. 37-45, Jan. 1993.
7. G.-L. Feng, V. K. Wei, T. R. N. Rao, and K. K. Tzeng, "Simplified understanding and efficient decoding of a class of algebraic-geometric codes," IEEE Trans. Inform. Theory, vol. 40, pp. 981-1002, 1994.
8. G. D. Forney, Jr., "On decoding BCH codes," IEEE Trans. Inform. Theory, vol. IT10, pp. 549-557, 1965.
9. J. P. Hansen, H. E. Jensen, and R. Kotier, "Determination of error values for algebraic-geometry codes and the Forney formula," IEEE Trans. Inform. Theory, vol. 44, pp. 1881-1886, Sept. 1998.
10. J. Justesen, K. J. Larsen, H. E. Jensen, and T. Hoholdt, "Fast decoding of codes from algebraic plane curves," IEEE Trans. Inform. Theory, vol. 38, pp. 111-119, 1992.
11. D. A. Leonard, "Error-locator ideals for algebraic-geometric codes," IEEE Trans. Inform. Theory, vol. 41, pp. 819-823, 1995.
12. "A generalized Forney formula for algebraic-geometric codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1263-1268, 1996.
13. M. E. O'Sullivan, "Decoding of codes defined by a single point on a curve," IEEE Trans. Inform. Theory, vol. 41, pp. 1709-1719, 1995.
14. R. Pellikaan, "On the efficient decoding of algebraic-geometric codes," in Eurocode 92, P.Camion, P. Charpin and S. Harari, Eds., (Udine, Italy, CISM Courses and Lectures, vol. 339). Wien-New York: SpringerVerlag, 1993, , pp. 231-253.
15. S. C. Porter, B.-Z. Shen, and R. Pellikaan, "Decoding geometric Goppa codes using an extra place," IEEE Trans. Inform. Theory, vol. 38, pp. 1663-1676, 1992.
16. K. Saints and C. Heegard, "Algebraic-geometric codes and multidimensional cyclic codes: A unified theory and algorithms for decoding using Gröbenr bases," IEEE Trans. Inform. Theory, vol. 41, pp. 1752-1768, 1995.
17. S. Sakata, "Finding a minimal set of linear recurring relations capable of generating a two-dimensional array," J. Symb. Comput. vol. 5, pp. 321-327, 1988.
18. S. Sakata, "Extension of Berlekamp-Massey algorithm to N dimensions," Inform. Comput., vol. 84, pp. 207-239, 1990.
19. S. Sakata, J. Justesen, Y. Madelung, H. E. Jensen, and T. H0holdt, "Fast decoding of AG-codes up to the designed minimum distance," IEEE Trans. Inform. Theory, vol. 41, pp. 1672-1677, 1995.
20. S. Sakata, D. A. Leonard, H. E. Jensen, and T. H0holdt, "Fast erasure and error decoding of algebraic geometry codes up to the Feng-Rao bound," IEEE Trans. Inform. Theory, vol. 44, pp. 1558-1564, July, 1998.
21. B.-Z. Shen, "On encoding and decoding of the codes from Hermitian curves," in Cryptography and Coding III, IMA Conf. Proc., Ser., 45, M. Ganley, Ed. Oxford, U.K.: Oxford Univ. Press, 1993, pp. 337-356.