Constructing permutations and complete permutations over finite fields via subfield-valued polynomials
From MaRDI portal
Publication:473089
DOI10.1016/j.ffa.2014.10.002zbMath1320.11123OpenAlexW2035843463MaRDI QIDQ473089
Xiwang Cao, Lei Hu, Zhengbang Zha
Publication date: 21 November 2014
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2014.10.002
Related Items (14)
New classes of complete permutation polynomials ⋮ Large classes of permutation polynomials over \(\mathbb {F}_{q^2}\) ⋮ Coset-wise affine functions and cycle types of complete mappings ⋮ Complete mappings and Carlitz rank ⋮ Cycle types of complete mappings of finite fields ⋮ Necessary and sufficient conditions of two classes of permutation polynomials ⋮ Complete permutation polynomials with the form \((x^{p^m} - x + \delta)^s + a x^{p^m} + b x\) over \(\mathbb{F}_{p^n}\) ⋮ A general construction of regular complete permutation polynomials ⋮ Compositions and parities of complete mappings and of orthomorphisms ⋮ On piece-wise permutation polynomials ⋮ Compositional inverses and complete mappings over finite fields ⋮ Several classes of complete permutation polynomials over finite fields of even characteristic ⋮ On derivatives of planar mappings and their connections to complete mappings ⋮ Constructions of complete permutation polynomials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some classes of monomial complete permutation polynomials over finite fields of characteristic two
- On the inverses of some classes of permutations of finite fields
- A new approach to permutation polynomials over finite fields
- On constructing permutations of finite fields
- When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)?
- Specific permutation polynomials over finite fields
- New methods for generating permutation polynomials over finite fields
- Permutation polynomials over finite fields from a powerful lemma
- A piecewise construction of permutation polynomials over finite fields
- Permutation polynomials of the form \(L(x) + S_{2k}^a + S_{2k}^b\) over \(\mathbb{F}_{q^{3k}}\)
- Permutation polynomials and applications to coding theory
- Two new permutation polynomials with the form \({\left(x^{2^k}+x+\delta\right)^{s}+x}\) over \({\mathbb{F}_{2^n}}\)
- New Kloosterman sums identities over \(\mathbb F_{2^m}\) for all \(m\).
- Further results on permutation polynomials over finite fields
- Permutation polynomials of the \((x^p - x+\delta)^s+L(x)\)
- Constructing permutations of finite fields via linear translators
- Several classes of complete permutation polynomials
- Cyclotomy and permutation polynomials of large indices
- A new approach to permutation polynomials over finite fields. II
- The compositional inverse of a class of bilinear permutation polynomials over finite fields of characteristic 2
- Four classes of permutation polynomials of \(\mathbb F_{2^m}\)
- A class of permutation polynomials of \(\mathbb F_{2^m}\) related to Dickson polynomials
- Classes of Permutation Polynomials Based on Cyclotomy and an Additive Analogue
- Permutation polynomials and translation planes of even order
- Two classes of permutation polynomials over finite fields
This page was built for publication: Constructing permutations and complete permutations over finite fields via subfield-valued polynomials
