Open Access
Capacity theorems for the relay channel
Thomas M. Cover,A. El Gamal +1 more
- Vol. 80, pp 572-584
TLDR
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.About:
The article was published on 1979-09-01 and is currently open access. It has received 3918 citations till now. The article focuses on the topics: Relay channel & Channel capacity.read more
Citations
More filters
Journal ArticleDOI
Auction-Based Resource Allocation for Cooperative Communications
TL;DR: Two auction mechanisms, the SNR auction and the power auction, that determine relay selection and relay power allocation in a distributed fashion are proposed and the existence and uniqueness of the Nash Equilibrium are proved.
Posted Content
Capacity of the Gaussian Two-way Relay Channel to within 1/2 Bit
TL;DR: This paper proposes an achievable scheme composed of nested lattice codes for the uplink and structured binning for the downlink and shows that the scheme achieves within 1/2 bit from the cut-set bound for all channel parameters and becomes asymptotically optimal as the signal to noise ratios increase.
Book
Topics in Multi-User Information Theory
TL;DR: This survey builds up knowledge on random coding, binning, superposition coding, and capacity converses by introducing progressively more sophisticated tools for a selection of source and channel models.
Journal ArticleDOI
Distributed space-time block coding
S. Yiu,Robert Schober,Lutz Lampe +2 more
TL;DR: It is shown that existing STBCs designed for N/sub c/ /spl ges/ 2 co-located antennas are favorable choices for the code matrix guaranteeing a diversity order of d = min{N/sub S/, N/ sub c/} if n/ sub S/ nodes are active.
Journal ArticleDOI
The discrete memoryless multiple-access channel with cribbing encoders
TL;DR: It is demonstrated that in some situations parts of the total cooperation line are achievable and it is proved that if the encoders and the decoder are allowed to be nondeterministic, the capacity regions are not increased.
References
More filters
Journal ArticleDOI
Noiseless coding of correlated information sources
David Slepian,Jack K. Wolf +1 more
TL;DR: The minimum number of bits per character R_X and R_Y needed to encode these sequences so that they can be faithfully reproduced under a variety of assumptions regarding the encoders and decoders is determined.
Journal ArticleDOI
Three-terminal communication channels
TL;DR: A coding theorem and weak converse are proved and a necessary and sufficient condition for a positive capacity is derived and upper and lower bounds on the capacity are obtained, which coincide for channels with symmetric structure.
Journal ArticleDOI
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.
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.
Journal ArticleDOI
On source coding with side information at the decoder
TL;DR: The characterization of the family of rate triples (R_0,R_1, R_2) for which this system can deliver essentially perfect reproductions of X and Y and the principal result is a characterization of this family via an information-theoretic minimization.