New constructions of 2-to-1 mappings over F₂^n and their applications to binary linear codes
From MaRDI portal
Publication:6835801
Cites work
- A characteristic property of self-orthogonal codes and its application to lattices
- A new almost perfect nonlinear function which is not quadratic
- An equivalent condition on the switching construction of differentially 4-uniform permutations on from the inverse function
- Application of cover-free codes and combinatorial designs to two-stage testing.
- Association schemes and coding theory
- Balanced Boolean functions with few-valued Walsh spectra parameterized by P(x^2+x)
- Bent functions, spreads, and o-polynomials
- Binary Linear Codes With Few Weights From Two-to-One Functions
- Boolean functions for cryptography and coding theory
- Characterizations and constructions of \(n\)-to-1 mappings over finite fields
- Compositional inverses of permutation polynomials of the form x^rh(x^s) over finite fields
- Constructing Differentially 4-Uniform Permutations Over <formula formulatype="inline"><tex Notation="TeX">${\BBF}_{2^{2k}}$</tex> </formula> via the Switching Method
- Constructing new APN functions and bent functions over finite fields of odd characteristic via the switching method
- Constructing permutations of finite fields via linear translators
- Error-Correction Capability of Binary Linear Codes
- Fundamentals of Error-Correcting Codes
- Further Study of 2-to-1 Mappings Over F2n
- scientific article; zbMATH DE number 3842614 (Why is no real title available?)
- scientific article; zbMATH DE number 4062030 (Why is no real title available?)
- scientific article; zbMATH DE number 1972828 (Why is no real title available?)
- scientific article; zbMATH DE number 939316 (Why is no real title available?)
- scientific article; zbMATH DE number 1394295 (Why is no real title available?)
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Minimal vectors in linear codes
- More About the Corpus of Involutions From Two-to-One Mappings and Related Cryptographic S-Boxes
- New classes of bent functions via the switching method
- New constructions of permutation polynomials of the form \(x + \gamma \operatorname{Tr}_q^{q^2}(h(x))\) over finite fields with even characteristic
- New constructions of permutation polynomials of the form \(x^rh\left( x^{q-1}\right) \) over \({\mathbb F}_{q^2}\)
- New PcN and APcN functions over finite fields
- New secondary constructions of differentially 4-uniform permutations over \(\mathbb F_{2^{2k}}\)
- Note on cubics over GF(2ⁿ) and GF(3ⁿ)
- On an algorithm generating 2-to-1 APN functions and its applications to ``The big APN problem
- On constructing permutations of finite fields
- On Dillon's class \(H\) of bent functions, Niho bent functions and o-polynomials
- On the solution of algebraic equations over finite fields
- On Two-to-One Mappings Over Finite Fields
- Parametric construction approach of balanced Boolean functions from two-to-one mappings
- Permutation polynomials of the form \(cx+\mathrm{Tr}_{q^l/ q}(x^a)\) and permutation trinomials over finite fields with even characteristic
- Permutation polynomials of the form \(x^r h (x^{q-1})\) over \(\mathbb{F}_{q^2}\) with even characteristics
- Quantum Error Correction and Orthogonal Geometry
- Quartics over GF(2 n )
- Several Families of Binary Minimal Linear Codes From Two-to-One Functions
- Several New Infinite Families of Bent Functions and Their Duals
- Switching Construction of Planar Functions on Finite Fields
- The classifications of o-monomials and of 2-to-1 binomials are equivalent
- Two-to-one mappings and involutions without fixed points over \(\mathbb{F}_{2^n}\)
- When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)?
This page was built for publication: New constructions of 2-to-1 mappings over \(\mathbb{F}_{2^n}\) and their applications to binary linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6835801)
