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
Self-Concatenated Code Design and its Application in Power-Efficient Cooperative Communications
TL;DR: The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented and the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date are identified.
Journal ArticleDOI
System Design and Throughput Analysis for Multihop Relaying in Cellular Systems
K.R. Jacobson,Witold A. Krzymien +1 more
TL;DR: A realistic model and typical cellular scenarios are used to show how relaying can be used to improve coverage and throughput in a real-world system.
Journal ArticleDOI
A New Upper Bound on the Capacity of a Primitive Relay Channel Based on Channel Simulation
TL;DR: An upper bound on the capacity of a primitive three-node discrete memoryless relay channel is considered, where a source X wants to send information to destination Y with the help of a relay Z.
Journal ArticleDOI
Random DS/CDMA for the amplify and forward relay channel
David Gregoratti,Xavier Mestre +1 more
TL;DR: Under these hypotheses, indeed, random matrix theory results show that it is possible to derive deterministic almost sure equivalents which are excellent approximations of the finite reality.
Journal ArticleDOI
Cut-Set Bound is Loose for Gaussian Relay Networks
Xiugang Wu,Ayfer Ozgur +1 more
TL;DR: A new upper bound on the capacity of the Gaussian primitive relay channel which is tighter than the cut-set bound is developed, which implies that the current capacity approximations for Gaussian relay networks are order-optimal and leads to a lower bound on a preconstant.
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.