Infoscience

Report

We consider the two message set problem, where a source broadcasts a common message $W_1$ to an arbitrary set of receivers $\mathcal{U}$ and a private message $W_2$ to a subset of the receivers $\mathcal{P}\subseteq \mathcal{U}$. Transmissions occur over linear deterministic channels. For the case where at most two receivers do not require the private message, we give an exact characterization of the capacity region, where achievability is through linear coding.

Reference

• LICOS-REPORT-2009-003

Record created on 2009-10-11, modified on 2016-08-08