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
Generalized Backward Decoding Strategies for the Relay Channel
TL;DR: Two new generalized strategies superimposing cooperation and facilitation are introduced and investigated on the general relay channel and give higher achievable rates than the generalized strategy of Cover and El Gamal for certain parameters on the Gaussian relay channel.
Journal ArticleDOI
Approximately Achieving Gaussian Relay Network Capacity With Lattice-Based QMF Codes
Ayfer Ozgur,Suhas Diggavi +1 more
TL;DR: The main result of this paper is that such structured lattice codes can approximately achieve the Gaussian relay network capacity universally, again within an additive constant.
Proceedings ArticleDOI
OPRA: Optimal Relay Assignment for Capacity Maximization in Cooperative Networks
Dejun Yang,Xi Fang,Guoliang Xue +2 more
TL;DR: An optimal relay assignment algorithm to solve the problem of relay assignment in cooperative networks, where multiple source-destination transmission pairs share the same set of relay nodes is developed and it is shown that the algorithm has several attractive properties.
Proceedings ArticleDOI
Cooperative diversity by relay phase rotations in block fading environments
TL;DR: This work considers a wireless network with one source/destination pair and several linear amplify-and-forward relays and proposes time-variant and relay specific phase rotations induced at each relay to make the effective channel time- Variant.
Journal ArticleDOI
Capacity-Optimized Topology Control for MANETs with Cooperative Communications
TL;DR: A novel Capacity-Optimized COoperative (COCO) topology control scheme for mobile ad hoc networks (MANETs) with cooperative communications that considers both upper layer network capacity and physical layer relay selections in the proposed scheme.
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.