ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider a private-message AWGN broadcast channel with Q>3Q>3 receivers, ordered by noise levels as N1≤N2≤⋯≤NQN_1\leq N_2\leq\cdots\leq N_Q. A group leader is the common subgraph obtained from a group of side-information graphs by removing all arcs from a stronger receiver to a weaker receiver. For receiver ii, let Ki\mathbf{K}_i denote the set of messages known to receiver ii. Capacity characterization conjecture. If, for every receiver ii in a group leader, each side-information message Mj∈KiM_j\in\mathbf{K}_i is also known to every receiver that is stronger than receiver ii and weaker than receiver jj, namely every receiver qq satisfying j<q<ij<q<i, then the capacity region can be established for all members of the group. The capacity region is achieved using Codebook Construction A and Decoding Scheme A.

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.