✦ LIBER ✦

Groups of Permutation Polynomials over Finite Fields

✍ Scribed by Richard M. Stafford

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 195 KB
Volume: 4
Category: Article
ISSN: 1071-5797
DOI: 10.1006/ffta.1998.0224

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Enumerating Permutation Polynomials over

Enumerating Permutation Polynomials over Finite Fields by Degree

✍ 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)

Factoring Polynomials over Special Finit

Factoring Polynomials over Special Finite Fields

✍ Eric Bach; Joachim von zur Gathen; Hendrik W. Lenstra Jr. 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 227 KB

We exhibit a deterministic algorithm for factoring polynomials in one variable over "nite "elds. It is e$cient only if a positive integer k is known for which I (p) is built up from small prime factors; here I denotes the kth cyclotomic polynomial, and p is the characteristic of the "eld. In the cas

Factoring Dickson Polynomials over Finit

Factoring Dickson Polynomials over Finite Fields

✍ Manjul Bhargava; Michael E. Zieve 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 105 KB

A Class of Polynomials over Finite Field

A Class of Polynomials over Finite Fields

✍ Arnaldo Garcia; Henning Stichtenoth 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 129 KB

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.

Permutation Properties of Chebyshev Poly

Permutation Properties of Chebyshev Polynomials of the Second Kind over a Finite Field

✍ M. Henderson; R. Matthews 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 317 KB

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 clas

The Number of Permutation Polynomials of

The Number of Permutation Polynomials of a Given Degree Over a Finite Field

✍ Pinaki Das 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 139 KB

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