Maximum nonlinearity of symmetric Boolean functions on odd number of variables
DOI10.1109/TIT.2002.801482zbMATH Open1062.94073OpenAlexW2168771278WikidataQ114084360 ScholiaQ114084360MaRDI QIDQ4677585FDOQ4677585
Authors: Subhamoy Maitra, Palash Sarkar 
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2002.801482
Recommendations
- Boolean functions on odd number of variables having nonlinearity greater than the bent concatenation bound
- scientific article; zbMATH DE number 5812603
- scientific article; zbMATH DE number 1583931
- scientific article; zbMATH DE number 1076147
- Symmetric Boolean functions depending on an odd number of variables with maximum algebraic immunity
Boolean functions (06E30) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Cited In (21)
- Certificate complexity and symmetry of nested canalizing functions
- Asymptotic behavior of perturbations of symmetric functions
- On various nonlinearity measures for Boolean functions
- Boolean functions on odd number of variables having nonlinearity greater than the bent concatenation bound
- Highly nonlinear (vectorial) Boolean functions that are symmetric under some permutations
- Linear structures of symmetric functions over finite fields
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- Metric complements to subspaces in the Boolean cube
- Stability of the Walsh-Hadamard spectrum of cryptographic Boolean functions with biased inputs
- Nonlinearity of some invariant Boolean functions
- Strict avalanche criterion over finite fields
- Modifying bent functions to obtain the balanced ones with high nonlinearity
- \(k\)th order symmetric SAC Boolean functions and bisecting binomial coefficients
- Sensitivities and block sensitivities of elementary symmetric Boolean functions
- Enumeration of balanced symmetric functions over \(GF(p)\)
- Improved lower bound on the number of balanced symmetric functions over \(\text{GF}(p)\)
- Title not available (Why is that?)
- Symmetric random function generator (SRFG): a novel cryptographic primitive for designing fast and robust algorithms
- On the fast algebraic immunity of threshold functions
- Derivatives of bent functions in connection with the bent sum decomposition problem
- Certificate complexity of elementary symmetric Boolean functions
This page was built for publication: Maximum nonlinearity of symmetric Boolean functions on odd number of variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4677585)
