List decoding of Reed-Solomon codes from a Gröbner basis perspective

Journal of Symbolic Computation

Volumn 43, Issue 9, 2008, Pages 645-658

  Lee, Kwankyu ^a   O'Sullivan, Michael E ^b  

^a Korea Institute for Advanced Study   (South Korea)

^b SAN DIEGO STATE UNIVERSITY   (United States)

Author keywords

Gr bner bases; Interpolation algorithm; List decoding; Reed Solomon codes

Indexed keywords

EID: 42649130660     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2008.01.002     Document Type: Article

References (14)

1. Alekhnovich M. Linear Diophantine equations over polynomials and soft decoding of Reed-Solomon codes. IEEE Trans. Inform. Theory 51 7 (2005) 2257-2265
2. Cox D., Little J., and O'Shea D. Ideals, Varieties, and Algorithms. 2nd ed. (1997), Springer-Verlag, New York
3. Cox D., Little J., and O'Shea D. Using Algebraic Geometry. 2nd ed. GTM vol. 185 (2005), Springer-Verlag, New York
4. Farr J.B., and Gao S. Gröbner bases, Padé approximation, and decoding of linear codes. Coding Theory and Quantum Computing. Contemp. Math. Amer. Math. Soc. vol. 381 (2005)
5. Fitzpatrick P. On the key equation. IEEE Trans. Inform. Theory 41 5 (1995) 1290-1302
6. Guruswami V. List decoding of error-correcting codes. Lecture Notes in Computer Science vol. 3282 (2005), Springer-Verlag
7. Guruswami V., and Sudan M. Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Trans. Inform. Theory 45 6 (1999) 1757-1767
8. Lee, K., O'Sullivan, M.E., 2006. An interpolation algorithm using Gröbner bases for soft-decision decoding of Reed-Solomon codes. in: Proc. IEEE Symp. Information Theory. Seattle, WA., pp. 2032-2036
9. Marinari M.G., Möller H.M., and Mora T. Gröbner bases of ideals defined by functionals with an application to ideals of projective points. Appl. Algebra Engrg. Comm. Comput. 4 2 (1993) 103-145
10. McEliece, R.J., 2003. The Guruswami-Sudan decoding algorithm for Reed-Solomon codes. Tech. Rep., IPN Progress Report
11. Nielsen R.R., and Høholdt T. Decoding Reed-Solomon codes beyond half the minimum distance. In: Buchmann J., Høholdt T., Stichtenoth H., and Tapia-Recillas H. (Eds). Coding Theory, Cryptography and Related Areas (2000), Springer 221-236
12. O'Keeffe H., and Fitzpatrick P. Gröbner basis solutions of constrained interpolation problems. Linear Algebra Appl. 351-352 (2002) 533-551
13. Sudan M. Decoding of Reed-Solomon codes beyond the error-correction bound. J. Complexity 13 1 (1997) 180-193
14. Welch, L., Berlekamp, E., 1986. Error correction for algebraic block codes. U. S. Patent 4 633 470, issued Dec. 30