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.
Permutation Properties of Chebyshev Polynomials of the Second Kind over a Finite Field
โ Scribed by M. Henderson; R. Matthews
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 317 KB
- Volume
- 1
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
โฆ Synopsis
A class of permutation polynomials amongst the Chebyshev polynomials of the second kind has been described by the second author. Cohen has shown that in prime fields of odd order or their degree 2 extensions these are the only examples of such polynomials. In this paper, the authors present new classes of such permutation polynomials in fields of characteristic (\leq 5). The results are extended to fields of characteristic 2, a case not considered previously. O 1995 Academic Press, Inc.
๐ SIMILAR VOLUMES
We relate the number of permutation polynomials in F q ยฝx of degree d q ร 2 to the solutions รฐx 1 ; x 2 ; . . . ; x q ร of a system of linear equations over F q , with the added restriction that x i =0 and x i =x j whenever i=j. Using this we find an expression for the number of permutation polynomi
The known permutation behaviour of the Dickson polynomials of the second kind in characteristic 3 is expanded and simpli"ed. 2002 Elsevier Science (USA)
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 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).
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