Abstract

Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication theory and so on. Permutation binomials and permutation trinomials attract people's interest due to their simple algebraic forms and additional extraordinary properties. In this paper, we find a new result about permutation binomials and construct several new classes of permutation trinomials. Some of them are generalizations of known ones.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call