New Constructions of Quadratic Bent Functions in Polynomial Form
From MaRDI portal
Cited in
(13)- Classification and construction of quaternary self-dual bent functions
- Three-weight ternary linear codes from a family of cyclic difference sets
- Connections between quaternary and Boolean bent functions
- Algebraic manipulation detection codes via highly nonlinear functions
- Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\)
- Linear codes with few weights from cyclotomic classes and weakly regular bent functions
- Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms
- Linear codes with two or three weights from quadratic bent functions
- Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
- Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights
- Ternary self-orthogonal codes from weakly regular bent functions and their application in LCD codes
- Dual and Hull code in the first two generic constructions and relationship with the Walsh transform of cryptographic functions
- Four decades of research on bent functions
This page was built for publication: New Constructions of Quadratic Bent Functions in Polynomial Form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986186)
