Some families of permutation polynomials over finite fields
By Michael E. Zieve. 2007
69 citations recorded by the source corpus.
We give necessary and sufficient conditions for a polynomial of the form xr(1 + xv + x2v + ⋯ + xkv)t to permute the elements of the finite field 𝔽q. Our results yield especially simple criteria in case (q - 1)/gcd(q - 1, v) is a small prime.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/85617499f20d994319d5ac90711c19b925908dc3
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Electrical and Electronic Engineering
Citations in the corpus
- On some permutation polynomials over Fq of the form x^r h(x^{(q-1)/d}) (2007, background): “Many of these results involved binomials of the form x + x where gcd(u − r, q − 1) ≥ (q − 1)/7; in our previous paper [35] we showed that these results can be derived more simply (and more generally) without using such sequences.”