Approximation of plateaued Boolean functions by monomial ones
From MaRDI portal
Recommendations
Cited in
(14)- On an approximate computation of the height of the maximal upper zero of a monotone Boolean function
- Fourier transforms and bent functions on finite groups
- On q-ary bent and plateaued functions
- Nonlinear functions and difference sets on group actions
- On a recursive class of plateaued Boolean functions
- scientific article; zbMATH DE number 4177135 (Why is no real title available?)
- Finding the subsets of variables of a partial Boolean function which are sufficient for its implementation in the classes defined by predicates
- scientific article; zbMATH DE number 7300360 (Why is no real title available?)
- Asymptotic estimates for numbers of Boolean mappings with given cryptographic properties
- scientific article; zbMATH DE number 6402335 (Why is no real title available?)
- On a lower bound for the number of bent functions at the minimum distance from a bent function in the Maiorana-McFarland class
- Characterization of some classes of isometric mappings that preserve self-duality of generalized bent function
- An improved upper bound for the number of plateaued binary mappings
- Generalized bent functions -- some general construction methods and related necessary and sufficient conditions
This page was built for publication: Approximation of plateaued Boolean functions by monomial ones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5117016)
