ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a broadcast relay channel with common relay have input alphabets represented by X,X1,X2X,X_1,X_2 and output alphabets Y1,Z1,Y2,Z2Y_1,Z_1,Y_2,Z_2. In the degraded case, the channel satisfies the Markov chains

X−∘−(X1,Z1)−∘−(Y1,Y2),(X,X1)−∘−Y1−∘−Y2.X \mathbin{-\mkern-6mu\circ\mkern-6mu-} (X_1,Z_1) \mathbin{-\mkern-6mu\circ\mkern-6mu-} (Y_1,Y_2),\qquad (X,X_1) \mathbin{-\mkern-6mu\circ\mkern-6mu-} Y_1 \mathbin{-\mkern-6mu\circ\mkern-6mu-} Y_2.

For auxiliary random variables U,VU,V satisfying (V,U)−∘−(X1,X)−∘−(Y1,Z1,Y2)(V,U) \mathbin{-\mkern-6mu\circ\mkern-6mu-} (X_1,X) \mathbin{-\mkern-6mu\circ\mkern-6mu-} (Y_1,Z_1,Y_2), let P\mathscr{P} be the set of all joint distributions PVUX1XP_{VUX_1X} with this Markov property. Capacity conjecture for the degraded broadcast relay channel with common relay. The capacity region is

R0≤I(U,V;Y2),R0+R1≤min⁡{I(X;Z1∣V,X1),I(X,X1;Y1)},R0+R1≤min⁡{I(X;Z1∣X1,V,U),I(X,X1;Y1∣U,V)}+I(V,U;Y2).\begin{array}{l} R_0 \leq I(U,V;Y_2),\\ R_0+R_1 \leq \min\{I(X;Z_1\mid V,X_1),I(X,X_1;Y_1)\}, \\ R_0+R_1 \leq \min\{I(X;Z_1\mid X_1,V,U),I(X,X_1;Y_1\mid U,V)\}+I(V,U;Y_2). \end{array}

The source states that the achievability part follows by taking U3=U4=∅U_3=U_4=\emptyset and V0=bU0+(1−b)X1V_0=bU_0+(1-b)X_1, with bb Bernoulli of parameter pp from the preceding theorem; thus the displayed region is presented as a resolved capacity characterization rather than an open conjecture.

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.