3,792 research outputs found
Further Results on Permutation Polynomials over Finite Fields
Permutation polynomials are an interesting subject of mathematics and have
applications in other areas of mathematics and engineering. In this paper, we
develop general theorems on permutation polynomials over finite fields. As a
demonstration of the theorems, we present a number of classes of explicit
permutation polynomials on \gf_q
A Recursive Construction of Permutation Polynomials over with Odd Characteristic from R\'{e}dei Functions
In this paper, we construct two classes of permutation polynomials over
with odd characteristic from rational R\'{e}dei functions. A
complete characterization of their compositional inverses is also given. These
permutation polynomials can be generated recursively. As a consequence, we can
generate recursively permutation polynomials with arbitrary number of terms.
More importantly, the conditions of these polynomials being permutations are
very easy to characterize. For wide applications in practice, several classes
of permutation binomials and trinomials are given. With the help of a computer,
we find that the number of permutation polynomials of these types is very
large
- β¦