A class of sudan-decodable codes

IEEE Transactions on Information Theory

Volumn 46, Issue 4, 2000, Pages 1564-1572

  Nielsen, R Refslund ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Algebraic geometry codes; Decoding; Reed solomon codes; Sudan's algorithm

Indexed keywords

ALGORITHMS; DECODING; ENCODING (SYMBOLS); ERROR CORRECTION; GEOMETRY; POLYNOMIALS; THEOREM PROVING;

ALGEBRAIC GEOMETRY CODES; HERMITIAN CODES; REED-SOLOMON CODES; SUDAN ALGORITHMS;

CODES (SYMBOLS);

EID: 0034226167     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.850696     Document Type: Article

References (7)

1. M. Y. Rosenbloom and M. A. Tsfasman, Codes for the m-metric, Probl. Inform. Transm., vol. 33, no. 1, pp. 45-52, 1997.
2. V. Guruswami and M. Sudan, Improved decoding of Reed-Solomon and algebraic-geometric codes, in Proc. 39th IEEE Symp. Foundations of Computer Science, 1998.
3. R. R. Nielsen, Decoding AG-Codes Beyond Half the Minimum Distance, Master's Thesis, Tech. Univ. Denmark, Lyngby, Aug. 1998.
4. M. Morii and M. Kasahara, Generalized key-equation of remainder decoding algorithm for Reed-Solomon codes, IEEE Trans. Inform. Theory, vol. 38, pp. 1801-1807, Nov. 1992.
5. S. B. Wicker and V. K. Bhargava, Reed-Solomon Codes and their Applications. Piscataway, NJ: IEEE Press, 1994, sec. 5.3, p. 87.
6. H. Stichtenoth, Algebraic Function Fields and Codes. Berlin, Germany: Springer-Verlag, 1993.
7. 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, pp. 1762-1768, Nov. 1995.