Prefer a chat interface with context about you and your work?
Upper bounds on the numbers of binary plateaued and bent functions
Abstract We prove that the logarithm of the number of binary n-variable bent functions is asymptotically less than (11/ 32) 2 n as n → ∞. We also prove an asymptotic upper bound on the number of s-plateaued functions.