2000 character limit reached
Proof of the Most Informative Boolean Function Conjecture (1511.01828v3)
Published 5 Nov 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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.