Enumerating permutation polynomials. II: \(k\)-cycles with minimal degree.
From MaRDI portal
Publication:1418184
DOI10.1016/S1071-5797(03)00044-3zbMath1035.11062MaRDI QIDQ1418184
Francesco Pappalardi, Claudia Malvenuto
Publication date: 19 January 2004
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Related Items (2)
On coefficients of polynomials over finite fields ⋮ Enumerating permutation polynomials over finite fields by degree
Uses Software
Cites Work
- The number of permutation polynomials of a given degree over a finite field
- Enumerating permutation polynomials. I: Permutations with non-maximal degree
- Enumerating permutation polynomials over finite fields by degree
- When Does a Polynomial Over a Finite Field Permute the Elements of the Field?
- When Does a Polynomial over a Finite Field Permute the Elements of the Field?, II
- The degrees of permutation polynomials over finite fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Enumerating permutation polynomials. II: \(k\)-cycles with minimal degree.