A complexity reducing transformation in algebraic list decoding of Reed-Solomon codes

Proceedings - 2003 IEEE Information Theory Workshop, ITW 2003

Volumn , Issue , 2003, Pages 10-13

  Koetter, R ^a   Vardy, A ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BLOCK CODES; FACTORIZATION; INFORMATION THEORY; INTERPOLATION; REED-SOLOMON CODES;

ALGEBRAIC SOFT DECODING; DECODING ALGORITHM; INTERPOLATION PROBLEMS; LIST DECODING; REDUCING TRANSFORMATIONS; SPACE AND TIME COMPLEXITY;

DECODING;

EID: 84939207617     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2003.1216682     Document Type: Conference Paper

References (14)

1. A. Ahmed, R. Koetter, and N. Shanbhag, "VLSI architectures for softdecision decoding of Reed-Solomon codes," JIBE Trans. VLSI Systems, submitted for publication, February 2003.
2. G.-L. Feng and X. Giraud, "Fast algorithm in Sudan decoding procedure for Reed-Solomon codes," preprint, August 2002.
3. W.J. Gross, ER. Kschischang, R. Koetter, and P.G. Gulak, "Towards a VLSI architecture for interpolation-based soft-decision Reed-Solomon decoders," J. VLSI Signal Processing, submitted, January 2003.
4. V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon and algebraic-geometric codes," LEEE Trans. Inform. Tbeory, vol. 45, pp. 1755-1764, September 1999.
5. R. Koetter, J. Ma, A. Vardy, and A. Ahmed, "Efficient interpolation and factorization in algebraic soft-decision decoding of Reed-Solomon codes," IEEEInt. Symp. Inform. Tbeory, Yokohama, Japan, July 2003.
6. R. Koetter and A. Vardy, "Algebraic soft-decision decoding of Reed-Solomon codes," IEEE Trans. Mom. Theory, submitted, August 2001.
7. R.R. Nielsen, "Decoding concatenated codes with Sudan's algorithm," EEE Trans. Inform. Theory, submitted for publication, May 2000.
8. R.R. Nielsen and T. Hplholdt, "Decoding Reed-Solomon codes beyond half the minimum distance," in CODING THEORY, CRYPTOGRAPHY, AND RELATEDA REAS(,B uchmann et al., Eds.), pp. 221-236, 1999.
9. F. Parvaresh and A. Vardy, "Multiplicity assignments for algebraic softdecoding of Reed-Solomon codes," LEEE Inr. Symp. Inform. Theory, Yokohama, Japan, July 2003, submitted for presentation.
10. L. Pecquet, "DBcodage en liste des codes g6omBtriques;' Ph.D. Thesis, UniversitB Pierre et Marie Curie, Paris, France, 2002.
11. R.M. Roth and G. Ruckenstein, "Efficient decoding of Reed-Solomon codes beyond half the minimum distance", EEE Trans. Inform. Theory, vol. 46, pp. 246258, 2000.
12. LR. Shafarevich, Basic Algebraic Geomefry. Springer-Verlag. 1995.
13. M. Sudan, "Decoding of Reed-Solomon codes beyond the error correction bound," J. Complexity, vol. 12, pp. 180-193, 1997.
14. L.R. Welch and E.R. Berlekamp, Error correction for algebraic block codes, U.S. Patent No. 4,633,470, issued December 30,1986.