ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let X∼Unif⁡(Hn)\mathbf{X}\sim\operatorname{Unif}(\mathbb{H}^n) be uniformly distributed on the Boolean hypercube, and let Y\mathbf{Y} be obtained by passing each bit of X\mathbf{X} through a binary symmetric channel with crossover probability p=(1−ρ)/2∈[0,1]p=(1-\rho)/2\in[0,1]. Let f:Hn↦Hf:\mathbb{H}^n\mapsto\mathbb{H} be a Boolean function, and let H2(p)=−plog⁡2(p)−(1−p)log⁡2(1−p)H_2(p)=-p\log_2(p)-(1-p)\log_2(1-p) be binary entropy. The most-informative Boolean function conjecture. One has

I(f(X);Y)≤1−H2(p).I(f(\mathbf{X});\mathbf{Y})\leq 1-H_2(p).

This conjecture asks which Boolean functions maximize the mutual information through a binary symmetric channel. It is known for balanced Boolean functions in a neighborhood of zero correlation, including ∣ρ∣≤0.44|\rho|\leq 0.44, but remains open in general.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.