On the average sensitivity of laced Boolean functions
Information Theory
2011-08-24 v2 Combinatorics
math.IT
Abstract
In this paper we obtain the average sensitivity of the laced Boolean functions. This confirms a conjecture of Shparlinski. We also compute the weights of the laced Boolean functions and show that they are almost balanced.
Keywords
Cite
@article{arxiv.1108.3198,
title = {On the average sensitivity of laced Boolean functions},
author = {Jiyou Li},
journal= {arXiv preprint arXiv:1108.3198},
year = {2011}
}
Comments
8 pages