Emergent Mind
Proof of the Most Informative Boolean Function Conjecture
(1511.01828)
Published Nov 5, 2015
in
cs.IT
and
math.IT
Abstract
Suppose $\XX{N}$ is a uniformly distributed $N$-dimensional binary vector and $\YY{N}$ is obtained by passing $\XX{N}$ through a binary symmetric channel with crossover probability $\alpha$. Recently, Courtade and Kumar postulates that $I(f(\XX{N});\YY{N})\leq 1-\Be(\alpha)$ for any Boolean function $f$ \cite{courtade}. In this paper, we provide a proof of the correctness of this conjecture.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.