AbstractLetFbe 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 onFgenerated by the permutations induced by the linear polynomials and any power map which induces a permutation onF. This generalizes a result of Leonard Carlitz (1953,Proc. Amer. Math. Soc.,4, 538)
The Carlitz rank of a permutation polynomial over a finite field Fq is a simple concept that was int...
The Carlitz rank of a permutation polynomial over a finite field Fq is a simple concept that was int...
L. Carlitz proved that any permutation polynomial f over a finite field Fq is a composition of linea...
AbstractLetFbe a finite field. We apply a result of Thierry Berger (1996,Designs Codes Cryptography,...
AbstractMethods for constructing large families of permutation polynomials of finite fields are intr...
A polynomial f over a finite field F is called a permutation polynomial if the mapping F→F defined b...
2000 Mathematics Subject Classification: 11T06, 13P10.A theorem of S.D. Cohen gives a characterizati...
AbstractWe present new classes of permutation polynomials over finite fields. If q is the order of t...
From the 19th century, the theory of permutation polynomial over finite fields, that are arose in th...
AbstractWe present different results derived from a theorem stated by Wan and Lidl [Permutation poly...
AbstractWe present two methods for generating linearized permutation polynomials over an extension o...
AbstractTwo classes of permutation polynomials over finite fields are presented. The first class is ...
Let H be a subgroup of the multiplicative group of a finite field. In this note we give a method for...
AbstractLet H be a subgroup of the multiplicative group of a finite field. In this note we give a me...
Using a lemma proved by Akbary, Ghioca, and Wang, we derive several theorems on permutation polynomi...
The Carlitz rank of a permutation polynomial over a finite field Fq is a simple concept that was int...
The Carlitz rank of a permutation polynomial over a finite field Fq is a simple concept that was int...
L. Carlitz proved that any permutation polynomial f over a finite field Fq is a composition of linea...
AbstractLetFbe a finite field. We apply a result of Thierry Berger (1996,Designs Codes Cryptography,...
AbstractMethods for constructing large families of permutation polynomials of finite fields are intr...
A polynomial f over a finite field F is called a permutation polynomial if the mapping F→F defined b...
2000 Mathematics Subject Classification: 11T06, 13P10.A theorem of S.D. Cohen gives a characterizati...
AbstractWe present new classes of permutation polynomials over finite fields. If q is the order of t...
From the 19th century, the theory of permutation polynomial over finite fields, that are arose in th...
AbstractWe present different results derived from a theorem stated by Wan and Lidl [Permutation poly...
AbstractWe present two methods for generating linearized permutation polynomials over an extension o...
AbstractTwo classes of permutation polynomials over finite fields are presented. The first class is ...
Let H be a subgroup of the multiplicative group of a finite field. In this note we give a method for...
AbstractLet H be a subgroup of the multiplicative group of a finite field. In this note we give a me...
Using a lemma proved by Akbary, Ghioca, and Wang, we derive several theorems on permutation polynomi...
The Carlitz rank of a permutation polynomial over a finite field Fq is a simple concept that was int...
The Carlitz rank of a permutation polynomial over a finite field Fq is a simple concept that was int...
L. Carlitz proved that any permutation polynomial f over a finite field Fq is a composition of linea...
DOI
Add to ORKG