An Upper Bound on the Number of Bent Functions

07/30/2021
by   Vladimir N. Potapov, et al.
0

The number of n-ary bent functions is less than 2^3·2^n-3(1+o(1)) as n is even and n→∞. Keywords: Boolean function, bent function, upper bound

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/29/2023

Upper bounds on the numbers of binary plateaued and bent functions

The logarithm of the number of binary n-variable bent functions is asymp...
research
04/01/2021

An upper bound on the Universality of the Quantum Approximate Optimization Algorithm

Using lie algebra, this brief text provides an upper bound on the univer...
research
08/11/2022

A New Bound for the Orthogonality Defect of HKZ Reduced Lattices

In this work, we determine a sharp upper bound on the orthogonality defe...
research
09/25/2018

An upper bound on ℓ_q norms of noisy functions

Let T_ϵ be the noise operator acting on functions on the boolean cube {0...
research
10/07/2019

A Lower Bound on the Number of Boolean Functions with Median Correlation Immunity

The number of n-ary balanced correlation immune (resilient) Boolean func...
research
06/27/2019

Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes

A d-dimensional polycube is a facet-connected set of cells (cubes) on th...
research
05/30/2022

Linear versus centred chromatic numbers

We prove that the linear chromatic number of any k× k pseudogrid is Ω(k)...

Please sign up or login with your details

Forgot password? Click here to reset