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 polynomials of Abelian group rings over finite fields
โ Scribed by Daniel A. Ashlock
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 267 KB
- Volume
- 86
- Category
- Article
- ISSN
- 0022-4049
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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)
Let A be a supersingular abelian variety over a finite field k which is k-isogenous to a power of a simple abelian variety over k. Write the characteristic polynomial of the Frobenius endomorphism of A relative to k as f = g e for a monic irreducible polynomial g and a positive integer e. We show th
Efficient algorithms are presented for factoring polynomials in the skew-polynomial ring F[x; ฯ], a non-commutative generalization of the usual ring of polynomials F[x], where F is a finite field and ฯ: F โ F is an automorphism (iterated Frobenius map). Applications include fast functional decomposi