AbstractWe give an explicit formula of the inverse polynomial of a permutation polynomial of the form xrf(xs) over a finite field Fq where s|q−1. This generalizes results in [A. Muratović-Ribić, A note on the coefficients of inverse polynomials, Finite Fields Appl. 13 (4) (2007) 977–980] where s=1 or f=gq−1s were considered respectively. We also apply our result to several interesting classes of permutation polynomials
Let p be a prime and q = pk. The polynomial gn,q isin Fp[x] defined by the functional equation Sigma...
Every function from a finite field to itself can be represented by a polynomial. The functions which...
We show that all of the "new" permutation polynomials in the recent paper arXiv:2207.13335 (H. Song ...
AbstractWe give an explicit formula of the inverse polynomial of a permutation polynomial of the for...
We give an explicit formula of the inverse polynomial of a permutation polynomial of the form xr f (...
AbstractWe present new classes of permutation polynomials over finite fields. If q is the order of t...
AbstractMethods for constructing large families of permutation polynomials of finite fields are intr...
AbstractTwo classes of permutation polynomials over finite fields are presented. The first class is ...
AbstractWe describe some relations on the coefficients of a polynomial in terms of the map that indu...
AbstractWe present different results derived from a theorem stated by Wan and Lidl [Permutation poly...
From the 19th century, the theory of permutation polynomial over finite fields, that are arose in th...
AbstractTwo new classes of permutation polynomials over finite fields are presented: (i) f(x)=(1−x−x...
Every function from a finite field to itself can be represented by a polynomial. The functions which...
AbstractLet H be a subgroup of the multiplicative group of a finite field. In this note we give a me...
Let p be a prime and q = pk. The polynomial gn,q isin Fp[x] defined by the functional equation Sigma...
Let p be a prime and q = pk. The polynomial gn,q isin Fp[x] defined by the functional equation Sigma...
Every function from a finite field to itself can be represented by a polynomial. The functions which...
We show that all of the "new" permutation polynomials in the recent paper arXiv:2207.13335 (H. Song ...
AbstractWe give an explicit formula of the inverse polynomial of a permutation polynomial of the for...
We give an explicit formula of the inverse polynomial of a permutation polynomial of the form xr f (...
AbstractWe present new classes of permutation polynomials over finite fields. If q is the order of t...
AbstractMethods for constructing large families of permutation polynomials of finite fields are intr...
AbstractTwo classes of permutation polynomials over finite fields are presented. The first class is ...
AbstractWe describe some relations on the coefficients of a polynomial in terms of the map that indu...
AbstractWe present different results derived from a theorem stated by Wan and Lidl [Permutation poly...
From the 19th century, the theory of permutation polynomial over finite fields, that are arose in th...
AbstractTwo new classes of permutation polynomials over finite fields are presented: (i) f(x)=(1−x−x...
Every function from a finite field to itself can be represented by a polynomial. The functions which...
AbstractLet H be a subgroup of the multiplicative group of a finite field. In this note we give a me...
Let p be a prime and q = pk. The polynomial gn,q isin Fp[x] defined by the functional equation Sigma...
Let p be a prime and q = pk. The polynomial gn,q isin Fp[x] defined by the functional equation Sigma...
Every function from a finite field to itself can be represented by a polynomial. The functions which...
We show that all of the "new" permutation polynomials in the recent paper arXiv:2207.13335 (H. Song ...