Enumerating permutation polynomials over finite fields by degree II

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal. First we extend the method of the previous paper proving an asymptotic formula for the number of permutations for which the associated permutation polynomial has d coefficients in specified fixed positions equal to 0. This also applies to the function Nq,d that counts the number of permutations for which the associated permutation polynomial has degree <q-d-1. Next we adopt a more precise approach to show that the asymptotic formula Nq,d∼q!/qd holds for d≤αq and α=0.03983. © 2005 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Konyagin, S., & Pappalardi, F. (2006). Enumerating permutation polynomials over finite fields by degree II. Finite Fields and Their Applications, 12(1), 26–37. https://doi.org/10.1016/j.ffa.2004.12.006

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free