Loading...
conference paper
On Broadcast with a Common Message over Networks
Vasudevan, Dinkar
•
Korada, Satish Babu
2008
2008 International Symposium On Information Theory And Its Applications
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.
Type
conference paper
Web of Science ID
WOS:000273504800148
Authors
Vasudevan, Dinkar
•
Korada, Satish Babu
Publication date
2008
Published in
2008 International Symposium On Information Theory And Its Applications
Start page
817
End page
822
Peer reviewed
REVIEWED
EPFL units
Event name | Event place | Event date |
Auckland, NEW ZEALAND | Dec 07-10, 2008 | |
Available on Infoscience
November 30, 2010
Use this identifier to reference this record