๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Groups of Permutation Polynomials over F
โœ Richard M. Stafford ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 195 KB

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.

Enumerating Permutation Polynomials over
โœ Sergei Konyagin; Francesco Pappalardi ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 85 KB

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)

Group Structures of Elementary Supersing
โœ Hui June Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 176 KB

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

Factoring in Skew-polynomial Rings over
โœ M. Giesbrecht ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 716 KB

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