ProbXiv
Explorersign in
Problem archiveProblem record

Statement

We consider the binary skew-symmetric broadcast channel with input XX and outputs Y1,Y2Y_1,Y_2. Let U,VU,V be random variables such that

(U,V)−X−(Y1,Y2)(U,V)-X-(Y_1,Y_2)

forms a Markov chain. Nair–Wang information inequality. For all such (U,V,X)(U,V,X),

I(U;Y1)+I(V;Y2)−I(U;V)≤max⁡(I(X;Y1),I(X;Y2)).I(U;Y_1)+I(V;Y_2)-I(U;V)\leq \max\bigl(I(X;Y_1),I(X;Y_2)\bigr).

The inequality is relevant to determining the capacity region of the binary skew-symmetric broadcast channel: if it holds, a sum-rate line segment on Marton's inner bound lies on its boundary. The source does not provide evidence that the conjecture has been resolved.

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.