Upper bounds on the numbers of binary plateaued and bent functions
Information Theory
2024-11-19 v3 Combinatorics
math.IT
Abstract
The logarithm of the number of binary n-variable bent functions is asymptotically less than as n tends to infinity. Keywords: boolean function, Walsh--Hadamard transform, plateaued function, bent function, upper bound
Cite
@article{arxiv.2303.16547,
title = {Upper bounds on the numbers of binary plateaued and bent functions},
author = {Vladimir N. Potapov},
journal= {arXiv preprint arXiv:2303.16547},
year = {2024}
}
Comments
11 pages