Abstract
The most important problem related to polynomials over finite fields is the problem of the factorization of a given polynomial over F q , in one or several variables, in irreducible factors over the same field. The simpler problem of finding its factorization pattern only (that is, the degrees of its factors) is of great interest too.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Shparlinski, I.E. (1999). Polynomial Factorization. In: Finite Fields: Theory and Computation. Mathematics and Its Applications, vol 477. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9239-0_3
Download citation
DOI: https://doi.org/10.1007/978-94-015-9239-0_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5203-2
Online ISBN: 978-94-015-9239-0
eBook Packages: Springer Book Archive