On constructing complete permutation polynomials over finite fields of even characteristic

Abstract

In this paper, a construction of complete permutation polynomials over finite fields of even characteristic proposed by Tu et al. recently is generalized in a recursive manner. Besides, several classes of complete permutation polynomials are derived by computing compositional inverses of known ones.

Stupid mistakes in previous versions are corrected

Cited by in corpus (4)

• Permutation polynomials induced from permutations of subfields, and some complete sets of mutually orthogonal latin squares
• More Classes of Complete Permutation Polynomials over $\F_q$
• Complete permutation polynomials induced from complete permutations of subfields
• Compositional inverses, complete mappings, orthogonal Latin squares and bent functions