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
Joint optimization of relay strategies and resource allocations in cooperative cellular networks
T.C.-Y. Ng,Wei Yu +1 more
TL;DR: It is shown that for a cellular system employing orthogonal frequency-division multiple-access (OFDMA), the optimization of physical-layer transmission strategies can be done efficiently by introducing a set of pricing variables as weighting factors.
Journal ArticleDOI
Towards an information theory of large networks: an achievable rate region
Piyush Gupta,P. R. Kumar +1 more
TL;DR: An information-theoretic constructive scheme for obtaining an achievable rate region in communication networks of arbitrary size and topology and communicating over a general vector discrete memoryless channel (DMC) is proposed.
Dissertation
Cooperative diversity in wireless networks: algorithms and architectures
TL;DR: This dissertation develops energy-efficient algorithms that employ certain kinds of cooperation among terminals, and illustrates how one might incorporate these algorithms into various network architectures, including current cellular and ad-hoc networks.
Journal ArticleDOI
In-Band Full-Duplex Relaying: A Survey, Research Issues and Challenges
TL;DR: Several important aspects of in-band FDR are identified: basics, enabling technologies, information-theoretical performance analysis, key design issues and challenges, and some broader perspectives for in- band FDR.
Journal ArticleDOI
On Capacity Under Receive and Spatial Spectrum-Sharing Constraints
TL;DR: This paper investigates the behavior of capacity when constraints are placed on the channel output signal (as well as generalizations thereof), finding that in certain network scenarios, including multiple-access and relay situations, both the structure of the problem and the conclusions change.
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.