Constructing permutations and complete permutations over finite fields via subfield-valued polynomials

摘要

We describe a recursive construction of permutation and complete permutation polynomials over a finite field F_(p~n) by using F_(p~k) -valued polynomials for several same or different factors k of n. As a result, we obtain some specific permutation polynomials which unify and generalize several previous constructions.