Paperlane

no. 9 · Thursday 5 November 2026

On the most informative Boolean function under noise

Dimiter Kramer and Mert Saglam

math.IT · 17 pp

Abstract

Let $X$ be a uniform random bit string and $Y$ be obtained by flipping each bit of $X$ independently with probability $p$. Let $C$ be a random bit obtained as a function of $Y$. We show that $\mathbf{I}(C:X)\le \mathbf{I}(Y_1:X)$ for all $p\in[0,1]$, which resolves a conjecture posed by Courtade and Kumar in 2013.

comments
17 pages, 2 figures
fields
Information Theory, Combinatorics
pdf ↗ page arXiv:2611.05430 ↗