Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
421126 | Discrete Applied Mathematics | 2015 | 10 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Baofeng Wu, Dongdai Lin,