We investigate monomials $ax^d$ over the finite field with q elements $F_q$, in the case where the degree d is equal to $1+rac{q-1}{q'-1}$ with $q=(q′)^n$ for some n. For n=6 we explicitly list all a's for which $ax^d$ is a complete permutation polynomial (CPP) over $F_q$. Some previous characterization results by Wu et al. for n=4 are also made more explicit by providing a complete list of a's such that $ax^d$ is a CPP. For odd n, we show that if q is large enough with respect to n then $ax^d$ cannot be a CPP over $F_q$, unless q is even, n≡3(mod4), and the trace Tr_{F_q/F_{q′}}(1/a) is equal to 0.

On monomial complete permutation polynomials

BARTOLI, DANIELE;GIULIETTI, Massimo;ZINI, GIOVANNI
2016

Abstract

We investigate monomials $ax^d$ over the finite field with q elements $F_q$, in the case where the degree d is equal to $1+rac{q-1}{q'-1}$ with $q=(q′)^n$ for some n. For n=6 we explicitly list all a's for which $ax^d$ is a complete permutation polynomial (CPP) over $F_q$. Some previous characterization results by Wu et al. for n=4 are also made more explicit by providing a complete list of a's such that $ax^d$ is a CPP. For odd n, we show that if q is large enough with respect to n then $ax^d$ cannot be a CPP over $F_q$, unless q is even, n≡3(mod4), and the trace Tr_{F_q/F_{q′}}(1/a) is equal to 0.
2016
File in questo prodotto:
File Dimensione Formato  
POSTPRINT-BGZ.pdf

Open Access dal 01/10/2018

Descrizione: PDF Postprint
Tipologia di allegato: Post-print
Licenza: Creative commons
Dimensione 227.94 kB
Formato Adobe PDF
227.94 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11391/1382003
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 24
  • ???jsp.display-item.citation.isi??? 21
social impact