On the Roth and Ruckenstein equations for the Guruswami-Sudan algorithm

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 2620-2624

  Augot, Daniel ^a,b   Zeh, Alexander ^a,b  

^a INRIA ROCQUENCOURT   (France)

^b UNIVERSITY OF STUTTGART   (Germany)

Author keywords

(Extended) Key Equation; Guruswami Sudan algorithm; List decoding; Polynomial interpolation; Reed Solomon codes

Indexed keywords

(EXTENDED) KEY EQUATION; BLOCK HANKEL MATRICES; DECODING ALGORITHMS; GURUSWAMI-SUDAN ALGORITHM; GURUSWAMI-SUDAN ALGORITHMS; INTERNATIONAL SYMPOSIUM; ITERATIVE ALGORITHMS; KEY EQUATION; LIST DECODING; POLYNOMIAL INTERPOLATION; REED-SOLOMON CODING;

ALGORITHMS; CHLORINE COMPOUNDS; CODES (SYMBOLS); CYBERNETICS; DECODING; INFORMATION THEORY; INTERPOLATION; REED-SOLOMON CODES; TECHNICAL PRESENTATIONS;

ITERATIVE METHODS;

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

References (13)

1. M. Sudan, "Decoding of Reed Solomon Codes beyond the Error-Correction Bound," Journal of Complexity, vol. 13, no. 1, pp. 180-193, March 1997. [Online]. Available: http://dx.doi.org/10.1006/jcom.1997. 0439
2. R. M. Roth and G. Ruckenstein, "Efficient decoding of Reed-Solomon codes beyond half the minimum distance," IEEE Transactions on Information Theory, vol. 46, no. 1, pp. 246-257, 2000. [Online]. Available: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=817522
3. G.-L. Feng and K. K. Tzeng, "A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes," IEEE Transactions on Information Theory, vol. 37, no. 5, pp. 1274-1287, 1991. [Online]. Available: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=133246
4. G. L. Feng and K. K. Tzeng, "An iterative algorithm of shift-register synthesis for multiple sequences," vol. 28. Scientia Sinica (Science in China) Series A, November 1985, pp. 1222-1232.
5. V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon and algebraic-geometry codes," IEEE Transactions on Information Theory, vol. 45, no. 6, pp. 1757-1767, 1999. [Online]. Available: http://ieeexplore. ieee.org/xpls/abs_all.jsp?amumber=782097
6. G. Ruckenstein, "Error decoding strategies for algebraic codes," Ph.D. dissertation, Technion, 2001. [Online]. Available: http://www.cs. technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/2001/PHD/PHD-2001- 01
7. H. Hasse, "Theorie der höheren Differentiale in einem algebraischen Funktionenkorper mit vollkommenem Konstantenkörper bei beliebiger Charakteristik." J. Reine Angew. Math., vol. 175, pp. 50-54, 1936.
8. Joachim and J. Gerhard, Modern Computer Algebra. Cambridge University Press, July 2003. [Online]. Available: http://www.amazon.ca/exec/ obidos/redirect? tag=citeulike09-20\&path=ASlN/0521826462
9. G.-L. Feng and K. K. Tzeng, "A new procedure for decoding cyclic and bch codes up to actual minimum distance," IEEE Transactions on Information Theory, vol. 40, no. 5, pp. 1364-1374, 1994. [Online]. Available: http://ieeexplore.ieee.org/xpls/abs_all.jsp?amumber=333854
10. S. Sakata, "n-dimensional Berlekamp-Massey algorithm for multiple arrays and construction of multivariate polynomials with preassigned zeros," in Applied algebra, algebraic algorithms and error-correcting codes (Rome, 1988), ser. Lecture Notes in Computer Science, T. Mora, Ed., vol. 357. Berlin: Springer, 1989, pp. 356-376. [Online]. Available: http://www.ams.org/mathscinet-getitem?mr=1008512
11. _, "Extension of the Berlekamp-Massey algorithm to n dimensions," Inf. Comput., vol. 84, no. 2, pp. 207-239, February 1990. [Online]. Available: http://portal.acm.org/citation.cfm?id=81252
12. G. Schmidt and V. R. Sidorenko, "Linear Shift-Register Synthesis for Multiple Sequences of Varying Length," May 2006. [Online]. Available: http://arxiv.org/abs/cs/0605044
13. G. Schmidt, V. Sidorenko, and M. Bossert, "Decoding Reed-Solomon Codes Beyond Half the Minimum Distance using Shift-Register Synthesis," in Information Theory, 2006 IEEE International Symposium on, 2006, pp. 459-463. [Online]. Available: http://ieeexplore.ieee.org/xpls/abs_all.jsp? arnumber=4036003