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(2^n)/32$ as n tends to infinity. Keywords: boolean function, Walsh--Hadamard transform, plateaued function, bent function, upper bound
- Publication:
-
arXiv e-prints
- Pub Date:
- March 2023
- DOI:
- 10.48550/arXiv.2303.16547
- arXiv:
- arXiv:2303.16547
- Bibcode:
- 2023arXiv230316547P
- Keywords:
-
- Computer Science - Information Theory;
- Mathematics - Combinatorics;
- 94D10;
- 94A60;
- 06E30
- E-Print:
- 9 pages