ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let q(y,z∣x)\mathfrak{q}(y,z\mid x) be a broadcast channel. Define

T(X):=max⁡p(u,v∣x)I(U;Y)+I(V;Z)−I(U;V)T(X):=\max_{p(u,v\mid x)} I(U;Y)+I(V;Z)-I(U;V)

and let C[f(X)]\mathfrak{C}[f(X)] denote the upper concave envelope of ff at p(x)p(x). For a product of two broadcast channels, write T(X1,X2)T(X_1,X_2) for the analogous quantity with outputs (Y1,Y2)(Y_1,Y_2) and (Z1,Z2)(Z_1,Z_2), and put λˉ=1−λ\bar\lambda=1-\lambda.

Factorization conjecture. For all product channels, all λ∈[0,1]\lambda\in[0,1], and all p(x1,x2)p(x_1,x_2),

−λH(Y1,Y2)−λˉH(Z1,Z2)+T(X1,X2)-\lambda H(Y_1,Y_2)-\bar\lambda H(Z_1,Z_2)+T(X_1,X_2) ≤C[−λH(Y1)−λˉH(Z1)+T(X1)]+C[−λH(Y2)−λˉH(Z2)+T(X2)].\leq \mathfrak{C}[-\lambda H(Y_1)-\bar\lambda H(Z_1)+T(X_1)] +\mathfrak{C}[-\lambda H(Y_2)-\bar\lambda H(Z_2)+T(X_2)].

The conjecture would imply that Marton's inner bound is optimal for the sum-rate of two-receiver discrete memoryless broadcast channels. It has been established for the endpoint values of λ\lambda, when one component channel is deterministic, and when one receiver in a component is more capable than the other; the general statement was subsequently established in the cited work.

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.