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
Wireless Physical-Layer Security: Lessons Learned From Information Theory
Aylin Yener,Sennur Ulukus +1 more
TL;DR: In this article, the authors provide an overview of research results in information-theoretic security with multiple wireless transmitters, and focus on distilling insights for designing wireless systems with confidentiality guarantees.
Journal ArticleDOI
Communication Via Decentralized Processing
TL;DR: The problem of a nomadic terminal sending information to a remote destination via agents with lossless connections to the destination is investigated and the Gaussian codebook capacity is characterized for the deterministic channel.
Journal ArticleDOI
Achievable Rate Regions and Performance Comparison of Half Duplex Bi-Directional Relaying Protocols
TL;DR: A comprehensive treatment of eight possible half-duplex bi-directional relaying protocols in Gaussian noise is provided, obtaining their relative performance under different SNR and relay geometries.
Journal ArticleDOI
Secrecy in Cooperative Relay Broadcast Channels
Ersen Ekrem,Sennur Ulukus +1 more
TL;DR: It is shown that user cooperation can increase the achievable secrecy region and an achievable scheme is proposed that combines Marton's coding scheme for broadcast channels and Cover and El Gamal's compress-and-forward scheme for relay channels.
Proceedings ArticleDOI
Cooperative coding for wireless networks
Andrej Stefanov,Elza Erkip +1 more
TL;DR: This work designs and analyzes channel codes that are capable of achieving the full diversity provided by user cooperation, with the constraint that they also provide the best possible performance in the interuser link.
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.