Linear diophantine equations over polynomials and soft decoding of Reed-Solomon codes

This paper generalizes the classical Knuth-Schoumlnhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine systems over polynomials in time, quasi-linear in the maximal degree. As an application, the following weighted curve fitting problem is considered: given a set of points in the plane, find an algebraic curve (satisfying certain degree conditions) that goes through each point the prescribed number of times. The main motivation for this problem comes from coding theory, namely, it is ultimately related to the list decoding of Reed-Solomon codes. This paper presents a new fast algorithm for the weighted curve fitting problem, based on the explicit construction of a Groebner basis. This gives another fast algorithm for the soft decoding of Reed-Solomon codes different from the procedure proposed by Feng, which works in time (w/r) O(1)nlog2n, where r is the rate of the code, and w is the maximal weight assigned to a vertical line

[1]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[2]  Lajos Rónyai,et al.  Factoring polynomials over finite fields , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[3]  Venkatesan Guruswami,et al.  Expander-based constructions of efficiently decodable codes , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[4]  P. R. Stein,et al.  Symmetric Function Algebra on a Computer , 1993 .

[5]  Michael Clausen,et al.  Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.

[6]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[7]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[8]  Arjen K. Lenstra,et al.  Factoring multivariate polynomials over finite fields , 1983, J. Comput. Syst. Sci..

[9]  J. Gathen.  Hensel and Newton methods in valuation rings , 1984 .

[10]  Venkatesan Guruswami,et al.  List decoding of error correcting codes , 2001 .

[11]  Kyriakos Kalorkoti.  ALGEBRAIC COMPLEXITY THEORY (Grundlehren der Mathematischen Wissenschaften 315) , 1999 .

[12]  Alexander Vardy,et al.  Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.

[13]  László Lovász,et al.  Algorithmic theory of numbers, graphs and convexity , 1986, CBMS-NSF regional conference series in applied mathematics.

[14]  Ron M. Roth,et al.  Efficient decoding of Reed-Solomon codes beyond half the minimum distance , 2000, IEEE Trans. Inf. Theory.

[15]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.