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...
Saved in:
Main Authors: | R. A. Mollin, C. Small |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
1987-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171287000644 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Characterizing absolutely irreducible integer-valued polynomials over discrete valuation domains
by: Hiebler, Moritz, et al.
Published: (2024) -
Vieta's triangular array and a related family of polynomials
by: Neville Robbins
Published: (1991-01-01) -
Permutation binomials
by: Charles Small
Published: (1990-01-01) -
On some permutation polynomials over finite fields
by: Amir Akbary, et al.
Published: (2005-01-01) -
On Hilbert polynomial of certain determinantal ideals
by: Shrinivas G. Udpikar
Published: (1991-01-01)