Journal Article10.1109/TIT.1979.1056046
A coding theorem for the discrete memoryless broadcast channel
786
TL;DR: A coding theorem for the discrete memoryless broadcast channel is proved for the case where no common message is to he transmitted and the result is tight for broadcast channels having one deterministic component.
read more
Abstract: A coding theorem for the discrete memoryless broadcast channel is proved for the case where no common message is to he transmitted. The theorem is a generalization of the results of Cover and van der Meulen on this problem. The result is tight for broadcast channels having one deterministic component
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Opportunistic beamforming using dumb antennas
Pramod Viswanath,David Tse,Rajiv Laroia +2 more
- 01 Jun 2002
TL;DR: This work shows that true beamforming gains can be achieved when there are sufficient users, even though very limited channel feedback is needed, and proposes the use of multiple transmit antennas to induce large and fast channel fluctuations so that multiuser diversity can still be exploited.
3.1K
Cooperative strategies and capacity theorems for relay networks
TL;DR: The capacity results generalize broadly, including to multiantenna transmission with Rayleigh fading, single-bounce fading, certain quasi-static fading problems, cases where partial channel knowledge is available at the transmitters, and cases where local user cooperation is permitted.
2.9K
On the achievable throughput of a multiantenna Gaussian broadcast channel
Giuseppe Caire,Shlomo Shamai +1 more
TL;DR: Under certain mild conditions, this scheme is found to be throughput-wise asymptotically optimal for both high and low signal-to-noise ratio (SNR), and some numerical results are provided for the ergodic throughput of the simplified zero-forcing scheme in independent Rayleigh fading.
2.8K
The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel
TL;DR: A new notion of an enhanced broadcast channel is introduced and is used jointly with the entropy power inequality, to show that a superposition of Gaussian codes is optimal for the degraded vector broadcast channel and that DPC is ideal for the nondegraded case.
2K
References
Broadcast channels with confidential messages
Imre Csiszár,János Körner +1 more
TL;DR: Given two discrete memoryless channels (DMC's) with a common input, a single-letter characterization is given of the achievable triples where R_{e} is the equivocation rate and the related source-channel matching problem is settled.
3.9K
Broadcast channels
TL;DR: This work introduces the problem of a single source attempting to communicate information simultaneously to several receivers and determines the families of simultaneously achievable transmission rates for many extreme classes of channels to lead to a new approach to the compound channels problem.
1.8K
Random coding theorem for broadcast channels with degraded components
TL;DR: This paper generalizes Cover's results on broadcast channels with two binary symmetric channels (BSC) to the class of degraded channels with N components, and shows a procedure to expurgate a good random broadcast code leading to a bound on the maximum probability of error.
617
Source coding with side information and a converse for degraded broadcast channels
Rudolf Ahlswede,János Körner +1 more
TL;DR: In Section H of the paper, a characterization of the capacity region for degraded broadcast channels (DBC's) is given, which was conjectured by Bergmans and is somewhat sharper than the one obtained by Gallager.
528
The Basic Theorems of Information Theory
TL;DR: In this article, the authors describe the mathematical models upon which communication theory is based, and present in some detail an exposition and partial critique of C. E. Shannon's treatment of one such model.