On the average sensitivity of laced Boolean functions
classification
💻 cs.IT
math.COmath.IT
keywords
booleanfunctionslacedaveragesensitivityalmostbalancedcompute
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.