An Outer Bound to the Capacity Region ofthe Broadcast Channel

Authors:
C. Nair;A. El Gamal
Affiliations:
Theor. Group, Microsoft Res., Redmond, WA, USA;-
Venue:
IEEE Transactions on Information Theory
Year:
2007

Citing 0
Cited 9

On power allocation for parallel Gaussian broadcast channels with common information

EURASIP Journal on Wireless Communications and Networking - Special issue on optimization techniques in wireless communications
The capacity region of a class of three-receiver broadcast channels with degraded message sets

IEEE Transactions on Information Theory
Capacity bounds for broadcast channels with confidential messages

IEEE Transactions on Information Theory
On the discrete memoryless partially cooperative relay broadcast channel and the broadcast channel with cooperating decoders

IEEE Transactions on Information Theory
Evaluation of Marton's inner bound for the general broadcast channel

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Correlated sources over broadcast channels

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Capacity regions of two new classes of 2-receiver broadcast channels

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
On 3-receiver broadcast channels with 2-degraded message sets

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Capacity regions of two new classes of two-receiver broadcast channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	755.08

Visualization

Abstract

An outer bound to the capacity region of the two-receiver discrete memoryless broadcast channel is given. The outer bound is tight for all cases where the capacity region is known. When specialized to the case of no common information, this outer bound is contained in the Koumlrner-Marton outer bound. This containment is shown to be strict for the binary skew-symmetric broadcast channel. Thus, this outer bound is in general tighter than all other known outer bounds.