Several classes of permutation polynomials based on the AGW criterion over the finite field \(\mathbb{F}_{2^{2m}}\)
From MaRDI portal
Publication:6191067
DOI10.1016/j.ffa.2024.102378OpenAlexW4391460509MaRDI QIDQ6191067
Publication date: 6 March 2024
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2024.102378
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)
- On the inverses of some classes of permutations of finite fields
- Permutation polynomials from trace functions over finite fields
- On constructing permutations of finite fields
- Permutation polynomials over finite fields from a powerful lemma
- A family of skew Hadamard difference sets
- Permutation polynomials and applications to coding theory
- Strongly regular graphs associated with ternary bent functions
- Permutation polynomials \((x^{p^m} - x + \delta)^{s_1} +(x^{p^m} - x + \delta)^{s_2} + x\) over \(\mathbb{F}_{p^n}\)
- New Kloosterman sums identities over \(\mathbb F_{2^m}\) for all \(m\).
- Minimal linear codes from weakly regular bent functions
- Further results on permutation polynomials and complete permutation polynomials over finite fields
- Further results on permutation polynomials from trace functions
- Further results on permutation polynomials over finite fields
- Some new forms of permutation polynomials based on the AGW criterion
- Permutation polynomials of the form \((x^{p^m} - x + \delta)^s + L(x)\) over the finite field \(\mathbb{F}_{p^{2 m}}\) of odd characteristic
- Permutation polynomials over \(\mathbb{F}_{2^n}\) of the form \((x^{2^i} + x + \delta)^{s_1} +(x^{2^i} + x + \delta)^{s_2} + x\)
- Complete permutation polynomials with the form \((x^{p^m} - x + \delta)^s + a x^{p^m} + b x\) over \(\mathbb{F}_{p^n}\)
- A note on complete polynomials over finite fields and their applications in cryptography
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound
- New Families of Codebooks Achieving the Levenstein Bound
- Several New Infinite Families of Bent Functions and Their Duals
- On the solution of algebraic equations over finite fields
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
This page was built for publication: Several classes of permutation polynomials based on the AGW criterion over the finite field \(\mathbb{F}_{2^{2m}}\)