Polynomials over Finite Fields Which Commute with a Permutation Polynomial
โ Scribed by C.Y. Chao
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 586 KB
- Volume
- 163
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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 prove an asymptotic formula for the number of permutations for which the associated permutation polynomial has degree smaller than q ร 2. # 2002 Elsevier Science (USA)
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