On constructing complete permutation polynomials over finite fields of even characteristic

TL;DR

This paper generalizes a method for constructing complete permutation polynomials over finite fields of even characteristic and derives new classes by computing compositional inverses, expanding the toolkit for finite field permutations.

Contribution

It introduces a recursive generalization of existing constructions and derives new classes of complete permutation polynomials through inverse computations.

Findings

Generalized the construction method recursively

Derived several new classes of complete permutation polynomials

Expanded understanding of permutation polynomial structures

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.