Constructing permutations and complete permutations over finite fields via subfield-valued polynomials
From MaRDI portal
Publication:473089
DOI10.1016/J.FFA.2014.10.002zbMATH Open1320.11123OpenAlexW2035843463MaRDI QIDQ473089FDOQ473089
Authors: Zhengbang Zha, Lei Hu, Xiwang Cao 
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
Recommendations
- A piecewise construction of permutation polynomials over finite fields
- On constructing permutations of finite fields
- On constructing complete permutation polynomials over finite fields of even characteristic
- A new class of permutation polynomials over finite fields
- On constructing two classes of permutation polynomials over finite fields
Cites Work
- Constructing permutations of finite fields via linear translators
- 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)\)
- Cyclotomy and permutation polynomials of large indices
- 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}\)
- Title not available (Why is that?)
- On the inverses of some classes of permutations of finite fields
- Two classes of permutation polynomials over finite fields
- On constructing permutations of finite fields
- Permutation polynomials over finite fields from a powerful lemma
- A piecewise construction of permutation polynomials over finite fields
- Two new permutation polynomials with the form \({\left(x^{2^k}+x+\delta\right)^{s}+x}\) over \({\mathbb{F}_{2^n}}\)
- Title not available (Why is that?)
- Several classes of complete permutation polynomials
- A new approach to permutation polynomials over finite fields
- When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)?
- Permutation polynomials and applications to coding theory
- Some classes of monomial complete permutation polynomials over finite fields of characteristic two
- A new approach to permutation polynomials over finite fields. II
- Specific permutation polynomials over finite fields
- Classes of permutation polynomials based on cyclotomy and an additive analogue
- Permutation polynomials of the form \(L(x) + S_{2k}^a + S_{2k}^b\) over \(\mathbb{F}_{q^{3k}}\)
- New methods for generating permutation polynomials over finite fields
- A class of permutation polynomials of \(\mathbb F_{2^m}\) related to Dickson polynomials
- Title not available (Why is that?)
- Permutation polynomials and translation planes of even order
Cited In (20)
- Several classes of complete permutation polynomials over finite fields of even characteristic
- New classes of complete permutation polynomials
- A note on constructing permutation polynomials
- On piece-wise permutation polynomials
- On constructing complete permutation polynomials over finite fields of even characteristic
- A piecewise construction of permutation polynomials over finite fields
- Irreducible factors of a class of permutation polynomials
- A note on complete polynomials over finite fields and their applications in cryptography
- Constructions of complete permutation polynomials
- A general construction of regular complete permutation polynomials
- Large classes of permutation polynomials over \(\mathbb {F}_{q^2}\)
- Complete permutation polynomials with the form \((x^{p^m} - x + \delta)^s + a x^{p^m} + b x\) over \(\mathbb{F}_{p^n}\)
- Coset-wise affine functions and cycle types of complete mappings
- Necessary and sufficient conditions of two classes of permutation polynomials
- On derivatives of planar mappings and their connections to complete mappings
- Cycle types of complete mappings of finite fields
- CONSTRUCTING PERMUTATION POLYNOMIALS OVER FINITE FIELDS
- Compositions and parities of complete mappings and of orthomorphisms
- Complete mappings and Carlitz rank
- Compositional inverses and complete mappings over finite fields
This page was built for publication: Constructing permutations and complete permutations over finite fields via subfield-valued polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q473089)
