Upper bounds on the numbers of binary plateaued and bent functions
Abstract
The logarithm of the number of binary n-variable bent functions is asymptotically less than 11(2n)/32 as n tends to infinity. Keywords: boolean function, Walsh--Hadamard transform, plateaued function, bent function, upper bound
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.