On Broadcast with a Common Message over Networks
We consider the following communication problem over a directed graph. A source node wants to transmit a common message to a set of receiver nodes along with a private message to each of the receivers. We show a class of networks for which the achievable rate region is given by the cut-set bounds.
- View record in Web of Science
Record created on 2010-11-30, modified on 2016-08-09