Generalized Bent Criteria for Boolean Functions (I)
From MaRDI portal
Publication:3548121
DOI10.1109/TIT.2006.880069zbMATH Open1323.94137arXivcs/0502049OpenAlexW2148230581MaRDI QIDQ3548121FDOQ3548121
Authors: Constanza Riera, Matthew G. Parker 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: Generalisations of the bent property of a boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic boolean functions are related to simple graphs and it is shown that the orbit generated by successive Local Complementations on a graph can be found within the transform spectra under investigation. The flat spectra of a quadratic boolean function are related to modified versions of its associated adjacency matrix.
Full work available at URL: https://arxiv.org/abs/cs/0502049
Recommendations
Cited In (34)
- ‐Relative Difference Sets and Their Representations
- On Boolean functions with several flat spectra
- On affine (non)equivalence of Boolean functions
- Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I,H,N} n Transform
- Some properties of cryptographic functions from \(\mathbb{Z}^n_2\) to \(\mathbb{Z}_q\)
- Generalized Walsh transforms of symmetric and rotation symmetric Boolean functions are linear recurrent
- Gowers U<sub>3</sub> Norm of Cubic MMF Bent-Negabent Functions Constructed by using Feistel Functions
- On Boolean Functions Which Are Bent and Negabent
- Several secondary methods for constructing bent-negabent functions
- Walsh spectrum and nega spectrum of complementary arrays
- A note on generalization of bent Boolean functions
- Generalized bent Boolean functions and strongly regular Cayley graphs
- The connection between quadratic bent-negabent functions and the Kerdock code
- Spectra of Boolean Functions, Subspaces of Matrices, and Going Up Versus Going Down
- From graph states to two-graph states
- Root-Hadamard transforms and complementary sequences
- Quantum algorithms related to \(HN\)-transforms of Boolean functions
- On negabent functions and nega-Hadamard transform
- Close Encounters with Boolean Functions of Three Different Kinds
- Bent and bent\(_4\) spectra of Boolean functions over finite fields
- On generalized nega-Hadamard transform and nega-crosscorrelation
- Graph eigenvalues and Walsh spectrum of Boolean functions
- On graphs and codes preserved by edge local complementation
- Relation between spectra of Narain CFTs and properties of associated Boolean functions
- Interlace polynomials: enumeration, unimodality and connections to codes
- Title not available (Why is that?)
- Constructions of negabent functions over finite fields
- Cryptographic Boolean functions with biased inputs
- On non-existence of bent-negabent rotation symmetric Boolean functions
- Walsh-Hadamard transforms of generalized \(p\)-ary functions and \(C\)-finite sequences
- Modified planar functions and their components
- Four decades of research on bent functions
- On the existence and non-existence of some classes of bent-negabent functions
- Introducing nega-forrelation: quantum algorithms in analyzing nega-Hadamard and nega-crosscorrelation spectra
This page was built for publication: Generalized Bent Criteria for Boolean Functions (I)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548121)
