Skip to search formSkip to main contentSkip to account menu

Balanced boolean function

In mathematics and computer science, a balanced boolean function is a boolean function whose output yields as many 0s as 1s over its input set. This… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Arithmetic Walsh transform(AWT) of Boolean function caught our attention due to their arithmetic analogs of Walsh-Hadamard… 
2015
2015
In 1994, Talagrand showed a generalization of the celebrated KKL theorem. In this work, we prove that the converse of this… 
2014
2014
LFSR-based stream ciphers with nonlinear filters or combiners are susceptible to algebraic attacks using linearization methods to… 
2013
2013
L’estequiometria ecologica preten explicar l’estil de vida dels organismes i l’estructura i funcio dels ecosistemes en relacio a… 
2006
2006
In this paper we study in detail how to design an efficient algorithm for checking whether a Boolean function has an annihilator… 
2004
2004
Binary sequences are the most fundamental random numbers and have been extensively used in several applications such as spread… 
2004
2004
Nonlinearity is a nonlinear criterion of Boolean function applied to crypto-system. In this paper, three new ways to construct… 
2002
2002
A gain graph (Γ, g, G) is a graph Γ = (V,E) together with a group G, the gain group, and a homomorphism g, the gain function…