Constructions and necessities of some permutation polynomials
classification
💻 cs.IT
math.IT
keywords
permutationpolynomialsnecessitiessomeapplicationsareasclassescoding
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Further results on some classes of permutation polynomials over finite fields
Further results on the permutation behavior of polynomial classes over finite fields together with constructions of new such classes.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.