Capacity conjecture for degraded broadcast relay channels with common relay
Statement
Let a broadcast relay channel with common relay have input alphabets represented by and output alphabets . In the degraded case, the channel satisfies the Markov chains
For auxiliary random variables satisfying , let be the set of all joint distributions with this Markov property. Capacity conjecture for the degraded broadcast relay channel with common relay. The capacity region is
The source states that the achievability part follows by taking and , with Bernoulli of parameter 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.