Exceptional Polynomials over Finite Fields
โ Scribed by S.D. Cohen; R.W. Matthews
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 641 KB
- Volume
- 1
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
โฆ Synopsis
A recently discovered family of indecomposable polynomials of nonprime power degree over (\mathbb{F}_{2}) (which include a class of exceptional polynomials) is set against the background of the classical families and their monodromy groups are obtained without recourse to the classification of finite simple groups. 1995 Academic Press, Inc
๐ SIMILAR VOLUMES
We exhibit a deterministic algorithm for factoring polynomials in one variable over "nite "elds. It is e$cient only if a positive integer k is known for which I (p) is built up from small prime factors; here I denotes the kth cyclotomic polynomial, and p is the characteristic of the "eld. In the cas
This survey reviews several algorithms for the factorization of univariate polynomials over finite fields. We emphasize the main ideas of the methods and provide an up-to-date bibliography of the problem.