ROOT-FINDING ALGORITHM FOR UNIVARIATE POLYNOMIALS WITH COEFFICIENTS FROM K[X,Y]
Abstract
Deterministic polynomial-time root-finding algorithm for univariate polynomials with coefficients from k[x,y] where k is a field of any characteristic is constructed. Our algorithm can be viewed as an extension of the Roth-Ruckenstein's root-finding algorithm to polynomials from k[x,y][T].
References
1. Маевский А.Э. О списочном декодировании одного класса алгебро-геометрических кодов на проективных кривых//Тр. участников международ. школы-семинара по геометрии и анализу памяти Н.В.Ефимова. -Абрау-Дюрсо, 5-11 сентября, 2006. -Ростов н/Д, 2006. -С. 55-56.
2. Roth R.M., Ruckenstein G. Efficient decoding of Reed-Solomon codes beyond half the minimum distance//IEEE Transactions on Information Theory. -Vol. 46, no. 1, January 2000. -P. 246-257.
3. Gathen J., Kaltofen E. Polynomal-time factorization of multivariate polynomials over finite fields//Lecture Notes in Computer Science. Springer-Verlag. -Vol. 154, 1983. -P. 250-262.
4. Shoup V. A computational introduction to number theory and algebra. -N.-Y.: Cambridge University Press, 2005. -534 p.
5. Wu X.W., Siegel P.H. Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes//IEEE Transactions on Information Theory. -Vol. 47, no. 6, September 2001. -P. 2579-2587.
Review
For citations:
MAEVSKIY A. ROOT-FINDING ALGORITHM FOR UNIVARIATE POLYNOMIALS WITH COEFFICIENTS FROM K[X,Y]. Vestnik of Don State Technical University. 2007;7(3):263-269. (In Russ.)
Views:
265
Email this article 