CONSTRUCTING PERMUTATION POLYNOMIALS OVER FINITE FIELDS
From MaRDI portal
Publication:5419385
DOI10.1017/S0004972713000646zbMath1301.11076arXiv1303.2229OpenAlexW3101131359MaRDI QIDQ5419385
Publication date: 6 June 2014
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.2229
Related Items
Groups of permutations generated by function-linear translator pairs, Further results on permutation polynomials via linear translators, The first and second moments of reversed Dickson polynomials over finite fields, New results on permutation polynomials over finite fields, Permutational behavior of reversed Dickson polynomials over finite fields, Permutational behavior of reversed Dickson polynomials over finite fields. II
Cites Work
- A note on constructing permutation polynomials
- When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)?
- Specific permutation polynomials over finite fields
- Permutation polynomials and applications to coding theory
- Permutation polynomials of the form \(x^r f(x^{(q-1)/d)}\) and their group structure
- Constructing permutations of finite fields via linear translators
- Classes of Permutation Polynomials Based on Cyclotomy and an Additive Analogue
- On some permutation polynomials over $\mathbb {F}_q$ of the form $x^r h(x^{(q-1)/d})$
- When Does a Polynomial Over a Finite Field Permute the Elements of the Field?
- Permutation binomials over finite fields
- SOME FAMILIES OF PERMUTATION POLYNOMIALS OVER FINITE FIELDS