Journal ArticleDOI
A proof of Marton's coding theorem for the discrete memoryless broadcast channel (Corresp.)
A. El Gamal,E.C. van der Meulen +1 more
Reads0
Chats0
TLDR
A simple proof using random partitions and typicality is given for Marton's coding theorem for broadcast channels.Abstract:
A simple proof using random partitions and typicality is given for Marton's coding theorem for broadcast channels.read more
Citations
More filters
Journal ArticleDOI
Writing on dirty paper (Corresp.)
TL;DR: It is shown that the optimal transmitter adapts its signal to the state S rather than attempting to cancel it, which is also the capacity of a standard Gaussian channel with signal-to-noise power ratio P/N.
Journal ArticleDOI
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.
Journal ArticleDOI
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.
Book
Network Information Theory
Abbas El Gamal,Young-Han Kim +1 more
TL;DR: In this article, a comprehensive treatment of network information theory and its applications is provided, which provides the first unified coverage of both classical and recent results, including successive cancellation and superposition coding, MIMO wireless communication, network coding and cooperative relaying.
References
More filters
Journal ArticleDOI
Capacity theorems for the relay channel
Thomas M. Cover,Abbas El Gamal +1 more
TL;DR: In this article, the capacity of the Gaussian relay channel was investigated, and a lower bound of the capacity was established for the general relay channel, where the dependence of the received symbols upon the inputs is given by p(y,y) to both x and y. In particular, the authors proved that if y is a degraded form of y, then C \: = \: \max \!p(x,y,x,2})} \min \,{I(X,y), I(X,Y,Y,X,Y
Capacity theorems for the relay channel
Thomas M. Cover,A. El Gamal +1 more
TL;DR: An achievable lower bound to the capacity of the general relay channel is established and superposition block Markov encoding is used to show achievability of C, and converses are established.
Journal ArticleDOI
A coding theorem for the discrete memoryless broadcast channel
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.
Journal ArticleDOI
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.
Journal ArticleDOI
A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)
TL;DR: It is established that the Slepian-Wolf theorem is true without change for arbitrary ergodic processes \{(X_i,Y_i)\}_{i=1}^{\infty} and countably infinite alphabets.