Recommendations
Cites work
- A new APN function which is not equivalent to a power mapping
- A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Codes, graphs, and schemes from nonlinear functions
- Crooked functions, bent functions, and distance regular graphs
- Crooked maps in \(\mathbb F_{2^n}\)
- scientific article; zbMATH DE number 2109875 (Why is no real title available?)
Cited in
(15)- A family of crooked functions
- Componentwise APNness, Walsh uniformity of APN functions, and cyclic-additive difference sets
- Almost perfect nonlinear trinomials and hexanomials
- Exceptional crooked functions
- The \textit{crooked} property
- On equivalence between known families of quadratic APN functions
- New semifields, PN and APN functions
- On the differential equivalence of APN functions
- Crooked maps in finite fields
- On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$
- When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)?
- On vectorial functions mapping strict affine subspaces of their domain into strict affine subspaces of their co-domain, and the strong D-property
- Line-parallelisms of \(\mathrm{PG}(n, 2)\) from preparata-like codes
- The only crooked power functions are \(x^{2^k+2^l}\)
- Almost perfect and planar functions
This page was built for publication: Crooked binomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008984)
