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 FpnFpn by using FpkFpk-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.