On permutation polynomials over finite fields
A polynomial f over a finite field F is called a permutation polynomial if the mapping F→F defined by f is one-to-one. In this paper we consider the problem of characterizing permutation polynomials; that is, we seek conditions on the coefficients of a polynomial which are necessary and sufficient f...
Main Authors: | R. A. Mollin, C. Small |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
1987-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171287000644 |
Similar Items
-
Some properties of generalized self-reciprocal polynomials over finite fields
by: Ryul Kim, et al.
Published: (2014-07-01) -
On the number of irreducible polynomials of special kinds in finite fields
by: Weihua Li, et al.
Published: (2020-04-01) -
Negacyclic Codes of Length <inline-formula> <tex-math notation="LaTeX">$2^mp^n$ </tex-math></inline-formula> Over Finite Fields
by: Jing Huang
Published: (2019-01-01) -
Further results on permutation polynomials and complete permutation polynomials over finite fields
by: Qian Liu, et al.
Published: (2021-09-01) -
A Study of Permutation Polynomials over Finite Fields
by: Fernando, Neranga
Published: (2013)