An Outer Bound to the Capacity Region ofthe Broadcast Channel
Authors:
- Abbas El GamalAGAbbas El Gamal
Top Cited Papers
- 26 December 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 53 (1) , 350-355
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.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- A coding theorem for the discrete memoryless broadcast channelIEEE Transactions on Information Theory, 1979
- The capacity of a class of broadcast channelsIEEE Transactions on Information Theory, 1979
- Evaluation of an achievable rate region for the broadcast channelIEEE Transactions on Information Theory, 1979
- Broadcast channels with confidential messagesIEEE Transactions on Information Theory, 1978
- An outer bound to the capacity region of broadcast channels (Corresp.)IEEE Transactions on Information Theory, 1978
- Source coding with side information and a converse for degraded broadcast channelsIEEE Transactions on Information Theory, 1975
- An achievable rate region for the broadcast channelIEEE Transactions on Information Theory, 1975
- Random coding theorems for the general discrete memoryless broadcast channelIEEE Transactions on Information Theory, 1975
- Random coding theorem for broadcast channels with degraded componentsIEEE Transactions on Information Theory, 1973
- Broadcast channelsIEEE Transactions on Information Theory, 1972