Upper bounds on the numbers of binary plateaued and bent functions
The logarithm of the number of binary n-variable bent functions is asymptotically less than (2^n)/3 as n tends to infinity. Keywords: boolean function, Walsh–Hadamard transform, plateaued function, bent function, upper bound
READ FULL TEXT