Key equations for list decoding of Reed-Solomon codes and how to solve them

Journal of Symbolic Computation

Volumn 45, Issue 7, 2010, Pages 773-786

  Beelen, Peter ^a   Brander, Kristian ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Guruswami Sudan algorithm; Interpolation; List decoding; Reed Solomon codes

Indexed keywords

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

References (15)

1. Alekhnovich M. Linear diophantine equations over polynomials and soft decoding of Reed-Solomon codes. IEEE Transactions on Information Theory 2005, 51(7).
2. Augot D., Zeh A. On the Roth and Ruckenstein equations for the Guruswami-Sudan algorithm. IEEE International Symposium on Information Theory, ISIT, 2008 2008, 2620-2624.
3. Beelen P., Høholdt T. List decoding using syndromes. World Scientific Series on Number Theory and its Applications 2008, vol. 5:315-331.
4. Blahut R.E. Algebraic Codes on Lines, Planes, and Curves 2008, Cambridge University Press. 1st ed.
5. Cox D., Little J., O'Shea D. Using Algebraic Geometry. Graduate Texts in Mathematics 2004, Springer. 2nd ed.
6. Fitzpatrick P. On the key equation. IEEE Transactions on Information Theory 1995, 41(5):1290-1302. URL: http://dx.doi.org/10.1109/18.412677.
7. Gathen J.v.z., Gerhard J. Modern Computer Algebra 2003, Cambridge University Press. 2nd ed.
8. Guruswami V., Sudan M. Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Transactions on Information Theory 1999, 45:1757-1767.
9. Justesen J., Høholdt T. A course in algebraic coding theory. EMS Textbooks in Mathematics 2003, European Mathematical Society.
10. Koetter, R., Ma, J., Vardy, A., Ahmed, A., 2003. Efficient interpolation and factorization in algebraic soft-decision decoding of Reed-Solomon codes. In: IEEE International Symposium on Information Theory, June-4 July 2003, pp. 365-365.
11. Lee K., O'Sullivan M.E. List decoding of Reed-Solomon codes from a Gröbner basis perspective. Journal of Symbolic Computation 2008, 43(9):645-658.
12. O'Keeffe H., Fitzpatrick P. Gröbner basis solutions of constrained interpolation problems. Journal of Linear Algebra and Applications 2002, 533-551.
13. Olshevsky V., Shokrollahi M.A. A displacement approach to efficient decoding of algebraic-geometric codes. STOC '99: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing 1999, 235-244. ACM, New York, NY, USA.
14. Roth R.M., Ruckenstein G. Efficient decoding of Reed-Solomon codes beyond half the minimum distance. IEEE Transactions on Information Theory 2000, 46(1):246-257.
15. Sudan M. Decoding of Reed-Solomon codes beyond the error-correction bound. Journal of Complexity 1997, 13(1):180-193.