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
MMSE-Based MIMO Cooperative Relaying Systems: Closed-Form Designs and Outage Behavior
TL;DR: This paper provides a new design strategy for optimizing the relay amplifying matrix and studies the error performance limit of the proposed scheme using diversity-multiplexing tradeoff analysis, which leads to several interesting observations on MMSE-based cooperative relaying systems.
Proceedings ArticleDOI
Cooperative Secrecy: The Relay-Eavesdropper Channel
Lifeng Lai,H. El Gamal +1 more
TL;DR: Noise-Forwarding (NF) strategy is shown to increase the perfect secrecy rate in the reversely degraded scenario, where the relay node fails to offer performance gains in the classical setting.
Journal ArticleDOI
Study of Gaussian Relay Channels with Correlated Noises
TL;DR: With individual power constraints at the relay and the source, it is shown that the relay should use all its available power to maximize the achievable rates under any correlation coefficient, and the optimal power allocation problem under the correlated-noise channel setting is considered.
Posted Content
Interference Channels with Rate-Limited Feedback
TL;DR: In this paper, the authors considered the two-user interference channel with rate-limited feedback and derived the inner and outer bounds for the three different interference models: the El Gamal-Costa deterministic model, the linear deterministic and the Gaussian model.
Proceedings ArticleDOI
Parity Forwarding For Multiple-Relay Networks
Peyman Razaghi,Wei Yu +1 more
TL;DR: This paper proposes a relaying strategy for networks with multiple relays where each relay forwards parities of decoded codewords and shows that relay networks can be degraded in more than one way and parity-forwarding is capacity achieving for a new form of degraded relay networks.
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.