Fast erasure-and-error decoding of algebraic geometry codes up to the feng-rao bound

IEEE Transactions on Information Theory

Volumn 44, Issue 4, 1998, Pages 1558-1564

  Sakata, Shojiro ^a   Leonard, Douglas A ^a   Jensen, Helge Elbrønd ^b   Høholdt, Tom ^c  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^b AUBURN UNIVERSITY   (United States)

^c TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Algebraic geometry codes; Erasure and error decoding; Sakata's algorithm

Indexed keywords

ALGEBRA; ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL METHODS; DECODING; ERROR ANALYSIS;

ALGEBRAIC GEOMETRIC CODES; BERLEKAMP-MASSEY ALGORITHMS; SAKATA'S ALGORITHMS;

INFORMATION THEORY;

EID: 0032122165     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.681332     Document Type: Article

References (17)

1. S. Sakata, "Finding a minimal sel of linear recurring relations capable of generating a given finite two-dimensional array," J. Symb. Comput., vol. 5, pp. 321-337, 1988.
2. _, "Extension of the Berlekamp-Massey algorithm to N dimensions," Inform. Comput., vol. 84, no. 2, pp. 207-239, Feb. 1990.
3. J. Justesen, K. J. Larsen, H. E. Jensen, and T. Høholdt, "Fast decoding of codes from algebraic plane curves," IEEE Trans. Inform. Theory, vol. 38. pp. 111-119, Jan. 1992.
4. S. Sakata, J. Justesen, Y. Madelung, H. E. Jensen, and T. Hholdt, "Fast decoding of AG-codes up to the designed minimum distance," IEEE Trans. Inform. Theory, vol. 41, pp. 1672-1677, Nov. 1995.
5. S. Sakata, H. E. Jensen, and T. Høholdt, "Generalized BerlekampMassey decoding of algebraic-geometric codes up to half the Feng-Rao bound," IEEE Trans. Inform. Theory, vol. 41, pp. 1762-1768, Nov. 1995.
6. T. Høholdt and R. Pellikaan, "On the decoding of algebraic-geometric codes,"/£££ 7ras. Inform. Theory, vol. 41, pp. 1589-1615, Nov. 1995.
7. M. E. O'Sullivan, "Decoding of codes defined by a single point on a curve," IEEE Trans. Inform. Theory, vol. 41, pp. 1709-1720, Nov. 1995.
8. B.-Z. Shen and K. K. Tzeng, "Generation of matrices for determining minimum distance and decoding of algebraic-geometric codes," IEEE Trans. Inform. Theory, vol. 41, pp. 1703-1709, Nov. 1995.
9. K. Saints and C. Heegard, "Algebraic-geometric codes and multidimensional cyclic codes: A unified theory and algorithms for decoding using Gröbner bases," IEEE Trans. Inform. Theory, vol. 41, pp. 1733-1752, Nov. 1995.
10. J. Massey, "Shift-register synthesis and BCH decoding," IEEE Trans. Inform. Theory, vol. IT-15, pp. 122-127, Jan. 1969.
11. S. Sakata, "Fast erasure-and-error decoding of any one-point AG-codes up to the Feng-Rao bound," in Proc. 1995 IEEE Int. Symp. Information Theory (Whistler, BC, Canada, Sept. 1995).
12. G. L. Feng, M. S. Kolluro, and T. R. N. Rao, "An erasures-anderrors decoding algorithm for algebraic-geometric codes," preprint, Univ. Southwestern Louisiana, 1994.
13. R. Kotier, "Fast generalized minimum distance decoding of algebraicgeometric and Reed-Solomon codes," Ph.D. dissertation, ch. 4, Linköping Univ., Linköping, Sweden, 1996.
14. G. L. Feng and T. R. N. Rao, "Decoding algebraic geometric codes up to the designed minimum distance," IEEE Trans. Inform. Theory, vol. 39. pp. 367, Jan. 1993.
15. A. N. Skorobogatov and S. G. Vlädu, "On the decoding of algebraicgeometric codes," IEEE Trans. Inform. Theory, vol. 36, pp. 1051-1061, Sept. 1990.
16. D. Leonard, "A generalized Forney formula for AG-codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1263-1269, July 1996.
17. R. Kotier, "A formula for the delerminalion of error values for Hermilian codes," in Proc. Int. Symp. Information Theory (Ulm, Germany, June 29-July 4, 1997).