Divide-and-conquer interpolation for list decoding of reed-Solomon codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 387-

  Ma, Jun ^a   Trifonov, Peter ^b   Vardy, Alexander ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b PETER THE GREAT ST PETERSBURG POLYTECHNIC UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE ALGORITHMS; NONZERO POLYNOMIALS; POLYNOMIAL INTERPOLATION; REED-SOLOMON CODES;

COMPUTATIONAL METHODS; DECODING; INTERPOLATION; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

CODES (SYMBOLS);

EID: 5044250019     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. D.A. Cox, J.B. LITTLE, and D. O'SHEA, Ideals, Varieties, and Algorithms, New York: Springer-Verlag, 1992.
2. G.-L. FENG and X. GIRAUD, Fast algorithm in Sudan decoding procedure for Reed-Solomon codes, preprint, August 2002.
3. R. KÖTTER, On Algebraic Decoding of Algebraic-Geometric and Cyclic Codes, Ph.D. Thesis, University of Linköping, Sweden, 1996.