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.


Published in:
2008 International Symposium On Information Theory And Its Applications, Vols 1-3, 817-822
Presented at:
International Symposium on Information Theory and Its Applications, Auckland, NEW ZEALAND, Dec 07-10, 2008
Year:
2008
Publisher:
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
Laboratories:




 Record created 2010-11-30, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)