Constructions and necessities of some permutation polynomials
Information Theory
2019-06-18 v1 math.IT
Abstract
Permutation polynomials over finite fields have important applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, etc. In this paper, we construct several new classes of permutation polynomials, and the necessities of some permutation polynomials are studied.
Keywords
Cite
@article{arxiv.1906.06453,
title = {Constructions and necessities of some permutation polynomials},
author = {Xiaogang Liu},
journal= {arXiv preprint arXiv:1906.06453},
year = {2019}
}
Comments
13