An interpolation algorithm using Gröbner bases for soft-decision decoding of reed-solomon codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 2032-2036

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

^a SAN DIEGO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CERTAIN MONOMIAL ORDER; INTERPOLATING POLYNOMIALS;

ALGORITHMS; INTERPOLATION; POLYNOMIALS; PROBLEM SOLVING;

REED-SOLOMON CODES;

EID: 39049154297     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261906     Document Type: Conference Paper

References (17)

1. M. Sudan, "Decoding of Reed-Solomon codes beyond the errorcorrection bound," J. Complexity, vol. 13, no. 1, pp. 180-193, 1997.
2. V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon and Algebraic-Geometry codes," IEEE Trans. Inform. Theory, vol. 45, no. 6, pp. 1757-1767, 1999.
3. R. Koetter and A. Vardy, "Algebraic soft-decision decoding of ReedSolomon codes," IEEE Trans. Inform. Theory, vol. 49, no. 11, pp. 2809-2825, 2003.
4. R. Kötter, "Fast generalized minimum-distance decoding of AlgebraicGeometry and Reed-Solomon codes," IEEE Trans. Inform. Theory, vol. 42, no. 3, pp. 721-736, 1996.
5. R. J. McEliece, "The Guruswami-Sudan decoding algorithm for ReedSolomon codes," IPN Progress Report, Tech. Rep., 2003.
6. R. R. Nielsen and T. Høholdt, "Decoding Reed-Solomon codes beyond half the minimum distance," in Coding Theory, Cryptogrphy and related areas, J. Buchmann, T. Høholdt, H. Stichtenoth, and H. Tapia-Recillas, Eds. Springer, 2000, pp. 221-236.
7. H. O'Keeffe and P. Fitzpatrick, "Gröbner basis solutions of constrained interpolation problems," Linear Algebra Appl., vol. 351/352, pp. 533551, 2002.
8. J. B. Farr and S. Gao, "Gröbner bases, Padé approximation, and decoding of linear codes," in Coding Theory and Quantum Computing, ser. Contemp. Math. Amer. Math. Soc., 2005, vol. 381, pp. 3-18.
9. V. Olshevsky and M. A. Shokrollahi, "A displacement approach to decoding algebraic codes," in Fast algorithms for structured matrices: theory and applications, ser. Contemp. Math. Amer. Math. Soc., 2003, vol. 323, pp. 265-292.
10. M. Kuijper and J. W. Polderman, "Reed-Solomon list decoding from a system-theoretic perspective," IEEE Trans. Inform. Theory, vol. 50, no. 2, pp. 259-271, 2004.
11. Y. Numakami, M. Fujisawa, and S. Sakata, "Fast interpolation methods for list decoding of RS codes," Trans. IEICE, vol. J83, pp. 1309-1317, 2000, in Japanese.
12. S. Sakata, "Applications of the BMS algorithm to decoding of algebraic codes," preprint for Workshop on Gröbner bases in Cryptography, Coding Theory and Algebraic Combinatorics, Linz, April 30-May 5, 2006.
13. M. Alekhnovich, "Linear Diophantine equations over polynomials and soft decoding of Reed-Solomon codes," IEEE Trans. Inform. Theory, vol. 51, no. 7, pp. 2257-2265, 2005.
14. K. Lee and M. E. O'Sullivan, "Sudan's list decoding of Reed-Solomon codes from a Gröbner basis perspective," arXiv:math.AC/0601022.
15. D. Cox, J. Little, and D. O'Shea, Ideals, Varieties, and Algorithms, 2nd ed. Springer-Verlag, New York, 1997.
16. _, Using Algebraic Geometry, 2nd ed., ser. GTM. Springer-Verlag, New York, 2005, vol. 185.
17. P. Fitzpatrick, "On the key equation," IEEE Trans. Inform. Theory, vol. 41, no. 5, pp. 1290-1302, 1995.