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
Proceedings ArticleDOI
Forwarding strategies for Gaussian parallel-relay networks
Ivana Maric,Roy D. Yates +1 more
TL;DR: The optimum bandwidth for AF is characterized and it is shown that transmitting in the optimum bandwidth allows the network to operate in the linear regime where the achieved rate increases linearly with transmit power.
Journal ArticleDOI
Design of Network Codes for Multiple-User Multiple-Relay Wireless Networks
TL;DR: For networks with orthogonal channels, it is shown that network codes based on maximum distance separable (MDS) codes can achieve the maximum diversity order of N+1, which is equivalent to achieving the Singleton bound for network error-correction codes.
Journal ArticleDOI
Robust Collaborative-Relay Beamforming
TL;DR: It is proved, under a condition on the quality of the estimated CSI, the robust-optimal collaborative-relay beamforming (CRBF) can be obtained by S-procedure and rank relaxation techniques, and a distributed algorithm is developed by examining the structure of the optimal CRBF solution.
Journal ArticleDOI
Cooperative multicast for maximum network lifetime
Ivana Maric,Roy D. Yates +1 more
TL;DR: The maximum lifetime accumulative broadcast (MLAB) algorithm that specifies the nodes' order of transmission and transmit power levels is presented and it is proved that the solution found by MLAB is optimal but not necessarily unique.
Journal ArticleDOI
Source and Channel Coding for Cooperative Relaying
Deniz Gunduz,Elza Erkip +1 more
TL;DR: This work proposes various strategies for cooperative source and channel coding that significantly improve the performance compared to the conventional scheme of source coding followed by cooperative channel coding, and characterize the optimal distortion exponent of a full-duplex relay channel for all bandwidth ratios.
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.