New list decoding algorithms for Reed-Solomon and BCH codes

IEEE Transactions on Information Theory

Volumn 54, Issue 8, 2008, Pages 3611-3630

  Wu, Yingquan ^a  

^a Link A Media Devices Corporation   (United States)

Author keywords

Berlekamp algorithm; Berlekamp Massey algorithm; Binary Bose Chaudhuri Hocquenghen (BCH) codes; Johnson bound; List decoding; Rational curve fitting algorithm; Reed Solomon codes

Indexed keywords

CODES (STANDARDS); CODES (SYMBOLS); CURVE FITTING; ERROR CORRECTION; NUMERICAL ANALYSIS; REED-SOLOMON CODES;

BCH CODES; BERLEKAMP ALGORITHM; BERLEKAMP-MASSEY ALGORITHM; BINARY BOSE-CHAUDHURI-HOCQUENGHEN (BCH) CODES; BOSE-CHAUDHURI-HOCQUENGHEN; CURVE FITTING ALGORITHM; ERROR CORRECTION CAPABILITY; JOHNSON BOUND; LIST DECODING; RATIONAL CURVE-FITTING ALGORITHM; REED-SOLOMON; REED-SOLOMON CODING;

DECODING;

EID: 48949106133     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.926355     Document Type: Article

References (28)

1. E. Agrell, A. Vardy, and K. Zeger, "Upper bounds for constant-weight codes," IEEE Trans. Inf. Theory, vol. 46, pp. 2373-2395, Nov. 2000.
2. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
3. E. R. Berlekamp, "Bounded distance + 1 soft-decision Reed-Solomon decoding," IEEE Trans. Inf. Theory, vol. 42, pp. 704-720, May 1996.
4. R. E. Blahut, Algebraic Codes for Data Transmission. Cambridge, U.K.: Cambridge University Press, 2003.
5. I. M. Duursma and R. Koetter, "Error-locating pairs for cyclic codes," IEEE Trans. Inf. Theory, vol. 40, pp. 1108-1121, Jul. 1994.
6. S. Egorov, G. Markarian, and K. Pickavance, "A modified Blahut algorithm for decoding Reed-Solomon codes beyond half the minimum distance," IEEE Trans. Commun., vol. 52, pp. 2052-2056, Dec. 2004.
7. P. Elias, "Error-correcting codes for list decoding," IEEE Trans. Inf. Theory, vol. 37, pp. 5-12, Jan. 1991.
8. G. D. Forney Jr., "On decoding BCH codes," IEEE Trans. Inf. Theory vol. 11, pp. 549-557, Oct. 1965.
9. V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon codes and algebraic-geometry codes," IEEE Trans. Inf. Theory, vol. 45, pp. 1757-1767, Sep. 1999.
10. V. Guruswami and M. Sudan, Extensions to the Johnson Bound 2000 [Online]. Available: http://people.csail.mit.edu/madhu/papers.html, unpublished
11. V. Guruswami and A. Rudra, "Limits to list decoding Reed-Solomon codes," IEEE Trans. Inf. Theory, vol. 52, pp. 3642-3649, Aug. 2006.
12. S. M. Johnson, "A new upper bound for error-correcting codes," IEEE Trans. Inf. Theory, vol. 8, pp. 203-207, Apr. 1962.
13. J. Justesen and T. Hoholdt, "Bounds on list decoding of MDS codes," IEEE Trans. Inf. Theory, vol. 47, pp. 1604-1609, May 2001.
14. N. Kamiya, "On algebraic soft-decision decoding algorithms for BCH codes," IEEE Trans. Inf. Theory, vol. 47, pp. 45-58, Jan. 2001.
15. R. Koetter, "Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes," IEEE Trans. Inf. Theory vol. 42, pp. 721-737, May 1996.
16. R. Koetter and A. Vardy, "Algebraic soft-decision decoding of Reed-Solomon codes," IEEE Trans. Inf. Theory, vol. 49, pp. 2809-2825, Nov. 2003.
17. R. Lidl and H. Niederreiter, Finite Fields. Reading, MA: Addison-Wesley, 1983.
18. J. Ma, P. Trifonov, and A. Vardy, "Divide-and-conquer interpolation for list decoding of Reed-Solomon codes," in Proc. IEEE Inf. Theory Workshop, Chicago, 2004, p. 386.
19. J. L. Massey, "Shift-register synthesis and BCH decoding," IEEE Trans. Inf. Theory, vol. 15, pp. 122-127, Jan. 1969.
20. R. J. McEliece, The Guruswami-Sudan Decoding Algorithm for Reed-Solomon Codes JPL Progress Rep. 42-153, 2003.
21. R. Roth and G. Ruckenstein, "Efficient decoding of Reed-Solomon codes beyond half the minimum distance," IEEE Trans. Inf. Theory, vol. 46, pp. 246-257, Jan. 2000.
22. G. Ruckenstein and R. M. Roth, "Bounds on the list-decoding radius of Reed-Solomon codes," SIAM J. Discr. Math., vol. 17, no. 2, pp. 171-195, 2003.
23. G. Schmidt, V. Sidorenko, and M. Bossert, "Decoding Reed-Solomon codes beyond half the minimum distance using shift-register synthesis," in Proc. IEEE Int. Symp. Inf. Theory, Seattle, WA, 2006, pp. 459-463.
24. H. Stichtenoth, Algebraic Function Fields and Codes. Berlin, Germany: Springer-Verlag, 1993.
25. M. Sudan, "Decoding of Reed-Solomon codes beyond the error-correction bound," J. Complexity, vol. 13, no. 1, pp. 180-193, 1997.
26. Y. Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa, "A method for solving key equation for decoding Goppa codes," Inf. Control, vol. 27, pp. 87-99, Feb. 1975.
27. L. R. Welch and E. R. Berlekamp, "Error Correction for Algebraic Block Codes," U.S.A. no. 4 633 470, Dec. 30, 1986.
28. X.-W. Wu and P. H. Siegel, "Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes," IEEE Trans. Inf. Theory, vol. 47, pp. 2579-2587, Sep. 2001.