New Classes of Permutation Binomials and Permutation Trinomials over Finite Fields

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 trinomials attract people's interest due to their simple algebraic form and additional extraordinary properties. In this paper, several new classes of permutation binomials and permutation trinomials are constructed. Some of these permutation polynomials are generalizations of known ones.

18 pages. Submitted to a journal on Aug. 15th

References in corpus (2)

• A Class of Binomial Permutation Polynomials
• Permutation polynomials on F_q induced from bijective Redei functions on subgroups of the multiplicative group of F_q

Cited by in corpus (5)

• Several Classes of Permutation Trinomials From Niho Exponents
• Permutation trinomials over ${\mathbb{F}}_{2^m}$: a corrected version
• New Permutation Trinomials From Niho Exponents over Finite Fields with Even Characteristic
• New Permutation Trinomials Constructed from Fractional Polynomials
• On Two Conjectures about Permutation Trinomials over ${\mathbb{F}}_{3^{2k}}$