On permutation polynomials of prescribed shape

Authors:
Amir Akbary;Dragos Ghioca;Qiang Wang
Affiliations:
Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, AB T1K 3M4, Canada;Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, AB T1K 3M4, Canada;School of Mathematics and Statistics, Carleton University, Ottawa, ON K1S 5B6, Canada
Venue:
Finite Fields and Their Applications
Year:
2009

Citing 8
Cited 1

When does a polynomial over a finite field permute the elements of the fields?

American Mathematical Monthly
Finite fields

Finite fields
Circular Tuscan-k arrays from permutation binomials

Journal of Combinatorial Theory Series A
Interleavers for turbo codes using permutation polynomials over integer rings

IEEE Transactions on Information Theory
Enumerating permutation polynomials over finite fields by degree II

Finite Fields and Their Applications
Permutation polynomials and applications to coding theory

Finite Fields and Their Applications
The Number of Permutation Polynomials of a Given Degree Over a Finite Field

Finite Fields and Their Applications
Enumerating Permutation Polynomials over Finite Fields by Degree

Finite Fields and Their Applications

On inverse permutation polynomials

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We count permutation polynomials of F"q which are sums of m+1(=2) monomials of prescribed degrees. This allows us to prove certain results about existence of permutation polynomials of prescribed shape.