Constructions and Necessities of Some Permutation Polynomials over Finite Fields
Keyword(s):
Let F q denote the finite field with q elements. Permutation polynomials over finite fields have important applications in many areas of science and engineering such as coding theory, cryptography, and combinatorial design. The study of permutation polynomials has a long history, and many results are obtained in recent years. In this paper, we obtain some further results about the permutation properties of permutation polynomials. Some new classes of permutation polynomials are constructed, and the necessities of some permutation polynomials are studied.
1990 ◽
Vol 49
(2)
◽
pp. 309-318
◽
2008 ◽
Vol 04
(05)
◽
pp. 851-857
◽
2005 ◽
Vol 2005
(16)
◽
pp. 2631-2640
◽
1987 ◽
Vol 30
(1)
◽
pp. 19-27
◽
1987 ◽
Vol 10
(3)
◽
pp. 535-543
◽
2021 ◽
2016 ◽
Vol 15
(07)
◽
pp. 1650133
◽
Several classes of permutation trinomials from Niho exponents over finite fields of characteristic 3
2019 ◽
Vol 18
(04)
◽
pp. 1950069
1969 ◽
Vol 7
(1)
◽
pp. 49-55
◽