Upper bounds on the numbers of binary plateaued and bent functions

03/29/2023
by   Vladimir N. Potapov, et al.
0

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

Please sign up or login with your details

Forgot password? Click here to reset

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro