On Broadcast with a Common Message over Networks

Satish Babu Korada, Dinkar Vasudevan
2008
Article de conférence

Résumé

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.

Source officielle

https://infoscience.epfl.ch/record/160191?ln=fr

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

On Broadcast with a Common Message over Networks

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al.

Better Trees for Santa Claus

Propagation on Multi-relational Graphs for Node Regression

Propagation on Multi-relational Graphs for Node Regression

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al.

Better Trees for Santa Claus