Asymptotic bounds for the affinity level for almost all Boolean functions
M. L. Buryakov · Discrete Mathematics and Applications · 2008
We consider the asymptotic behaviour of one of the parameters of the Boolean functions known as the affinity level. We show that almost all Boolean functions of n variables have the generalised affinity level exceeding n – α log 2 n , α > 1, obtain an asymptotic upper bound for the partial affinity level, consider the asymptotic behaviour of the affinity level for the quadratic Boolean functions.