AbstractMethods for constructing large families of permutation polynomials of finite fields are introduced. For some of these permutations the cycle structure and the inverse mapping are determined. The results are applied to lift minimal blocking sets of PG(2,q) to those of PG(2,qn)
AbstractWe give an explicit formula of the inverse polynomial of a permutation polynomial of the for...
AbstractPermutation polynomials have been an interesting subject of study for a long time and have a...
2000 Mathematics Subject Classification: 11T06, 13P10.A theorem of S.D. Cohen gives a characterizati...
AbstractMethods for constructing large families of permutation polynomials of finite fields are intr...
International audienceWe show that many infinite classes of permutations over finite fields can be ...
AbstractWe present two methods for generating linearized permutation polynomials over an extension o...
AbstractWe study permutation polynomials of the shape G(X)+γTr(H(X)) in Fpn[X]. Using a link with fu...
AbstractTwo classes of permutation polynomials over finite fields are presented. The first class is ...
AbstractLetFbe a finite field. We apply a result of Thierry Berger (1996,Designs Codes Cryptography,...
AbstractWe present new classes of permutation polynomials over finite fields. If q is the order of t...
We first study the ring of q-polynomials over Fq by constructing an isomorphism between this ring an...
From the 19th century, the theory of permutation polynomial over finite fields, that are arose in th...
AbstractLet H be a subgroup of the multiplicative group of a finite field. In this note we give a me...
AbstractWe present different results derived from a theorem stated by Wan and Lidl [Permutation poly...
A polynomial f over a finite field F is called a permutation polynomial if the mapping F→F defined b...
AbstractWe give an explicit formula of the inverse polynomial of a permutation polynomial of the for...
AbstractPermutation polynomials have been an interesting subject of study for a long time and have a...
2000 Mathematics Subject Classification: 11T06, 13P10.A theorem of S.D. Cohen gives a characterizati...
AbstractMethods for constructing large families of permutation polynomials of finite fields are intr...
International audienceWe show that many infinite classes of permutations over finite fields can be ...
AbstractWe present two methods for generating linearized permutation polynomials over an extension o...
AbstractWe study permutation polynomials of the shape G(X)+γTr(H(X)) in Fpn[X]. Using a link with fu...
AbstractTwo classes of permutation polynomials over finite fields are presented. The first class is ...
AbstractLetFbe a finite field. We apply a result of Thierry Berger (1996,Designs Codes Cryptography,...
AbstractWe present new classes of permutation polynomials over finite fields. If q is the order of t...
We first study the ring of q-polynomials over Fq by constructing an isomorphism between this ring an...
From the 19th century, the theory of permutation polynomial over finite fields, that are arose in th...
AbstractLet H be a subgroup of the multiplicative group of a finite field. In this note we give a me...
AbstractWe present different results derived from a theorem stated by Wan and Lidl [Permutation poly...
A polynomial f over a finite field F is called a permutation polynomial if the mapping F→F defined b...
AbstractWe give an explicit formula of the inverse polynomial of a permutation polynomial of the for...
AbstractPermutation polynomials have been an interesting subject of study for a long time and have a...
2000 Mathematics Subject Classification: 11T06, 13P10.A theorem of S.D. Cohen gives a characterizati...
DOI
Add to ORKG