ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Xn∼Unif⁡(Hn)X^n\sim\operatorname{Unif}(\mathbb{H}^n), let YnY^n be obtained by passing XnX^n through a binary symmetric channel with crossover probability p∈[0,1]p\in[0,1], and let V∈HV\in\mathbb{H} be binary with Xn→Yn→VX^n\to Y^n\to V forming a Markov chain. Define binary convolution by

a∗b=a(1−b)+(1−a)b,a\ast b=a(1-b)+(1-a)b,

and let H2−1:[0,1]↦[0,1/2]H_2^{-1}:[0,1]\mapsto[0,1/2] be the inverse of binary entropy. The Markov-chain extension conjecture. One has

H2(p∗H2−1(1−I(V;Yn)))≤1−I(V;Xn).H_2\bigl(p\ast H_2^{-1}(1-I(V;Y^n))\bigr)\leq 1-I(V;X^n).

This extension preserves the degraded-channel structure and would provide a stronger route to the original conjecture. The paper gives no proof and treats it as open.

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.