We prove that the logarithm of the number of binary n-variable bent functions is asymptotically less than (11/ 32) 2n as n → ∞. We also prove an asymptotic upper bound on the number of s-plateaued functions.
Research Article
Upper bounds on the numbers of binary plateaued and bent functions
https://doi.org/10.21203/rs.3.rs-3447791/v1
This work is licensed under a CC BY 4.0 License
You are reading this latest preprint version
We prove that the logarithm of the number of binary n-variable bent functions is asymptotically less than (11/ 32) 2n as n → ∞. We also prove an asymptotic upper bound on the number of s-plateaued functions.
Boolean function
Walsh-Hadamard transform
plateaued function
bent function
upper bound
No competing interests reported.
Editorial decision: Revision requested
09 Aug, 2024
Reviews received at journal
04 Aug, 2024
Reviewers agreed at journal
09 Jul, 2024
Reviews received at journal
31 Mar, 2024
Reviewers agreed at journal
11 Jan, 2024
Reviewers agreed at journal
01 Jan, 2024
Reviewers invited by journal
23 Oct, 2023
Editor assigned by journal
16 Oct, 2023
Submission checks completed at journal
15 Oct, 2023
First submitted to journal
15 Oct, 2023
You are reading this latest preprint version