2000 character limit reached
The "Most informative boolean function" conjecture holds for high noise (1510.08656v1)
Published 29 Oct 2015 in cs.IT, math.CO, math.IT, and math.PR
Abstract: We prove the "Most informative boolean function" conjecture of Courtade and Kumar for high noise $\epsilon \ge 1/2 - \delta$, for some absolute constant $\delta > 0$. Namely, if $X$ is uniformly distributed in ${0,1}n$ and $Y$ is obtained by flipping each coordinate of $X$ independently with probability $\epsilon$, then, provided $\epsilon \ge 1/2 - \delta$, for any boolean function $f$ holds $I(f(X);Y) \le 1 - H(\epsilon)$. This conjecture was previously known to hold only for balanced functions.
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.