Bent functions embedded into the recursive framework of \(\mathbb{Z}\)-bent functions
From MaRDI portal
Publication:1009081
DOI10.1007/S10623-008-9189-3zbMath1179.94061OpenAlexW1987353527MaRDI QIDQ1009081
Gregor Leander, Hans Dobbertin
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-008-9189-3
Related Items (7)
A new construction of bent functions based on \({\mathbb{Z}}\)-bent functions ⋮ Four decades of research on bent functions ⋮ Unnamed Item ⋮ New secondary constructions of bent functions ⋮ A note on non-splitting \(\mathbb Z\)-bent functions ⋮ Gowers \(U_2\) norm as a measure of nonlinearity for Boolean functions and their generalizations ⋮ Generic constructions of \(\mathbb{Z}\)-bent functions
Cites Work
- Unnamed Item
- Unnamed Item
- New cyclic difference sets with Singer parameters
- On ``bent functions
- Some results about the cross-correlation function between two maximal linear sequences
- An alternate characterization of the bentness of binary functions, with uniqueness
- A characterization of binary bent functions
- Normal Extensions of Bent Functions
- Niho type cross-correlation functions via dickson polynomials and Kloosterman sums
- Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture
- Some new three-valued crosscorrelation functions for binary m-sequences
- Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences
- A Survey of Some Recent Results on Bent Functions
This page was built for publication: Bent functions embedded into the recursive framework of \(\mathbb{Z}\)-bent functions
