ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider a two-receiver memoryless broadcast channel with states and receiver message side information (RMSI), together with the corresponding channel without RMSI. Let a transmission scheme for the channel without RMSI be transformed by the pre-coding described in the paper, treating the common message as Mm=(M0,M3,M4)M_\text{m}=(M_0,M_3,M_4) and the private messages as M1M_1 and M2M_2. Optimal pre-coding conjecture. If the original scheme achieves the capacity region of the channel without RMSI, then the scheme obtained by applying this pre-coding achieves the capacity region of the same channel with RMSI. The conjecture asserts that this pre-coding preserves optimality when receiver message side information is introduced; whether this holds for every such capacity-achieving scheme remains 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.