Let k=GF(q) be the finite field of order q. Let f 1 (x), f 2 (x) # k[x] be monic relatively prime polynomials satisfying n=deg f 1 >deg f 2 0 and f 1 (x)รf 2 (x){ g 1 (x p )รg 2 (x p ) for any g 1 (x), g 2 (x) # k[x]. Write Q(x)= f 1 (x)+tf 2 (x) and let K be the splitting field of Q(x) over k(t). L
Periods of Maps on Irreducible Polynomials over Finite Fields
โ Scribed by Patrick Morton
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 254 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Generalizing the norm and trace mappings for % O P /% O , we introduce an interesting class of polynomials over "nite "elds and study their properties. These polynomials are then used to construct curves over "nite "elds with many rational points.
Let F be a finite field. We apply a result of Thierry Berger (1996, Designs Codes Cryptography, 7, 215-221) to determine the structure of all groups of permutations on F generated by the permutations induced by the linear polynomials and any power map which induces a permutation on F.
We study value sets of polynomials over a finite field, and value sets associated to pairs of such polynomials. For example, we show that the value sets (counting multiplicities) of two polynomials of degree at most d are identical or have at most q!(q!1)/d values in common where q is the number of
Let T n (x, a) สฆ GF(q)[x] be a Dickson polynomial over the finite field GF(q) of either the first kind or the second kind of degree n in the indeterminate x and with parameter a. We give a complete description of the factorization of T n (x, a) over GF(q).