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
Dispensing with Channel Estimation: Differentially Modulated Cooperative Wireless Communications
Li Wang,Lajos Hanzo +1 more
TL;DR: These investigations demonstrate the quantitative benefits of cooperative wireless networks both from a pure capacity perspective as well as from a practical system design perspective.
Journal ArticleDOI
Network-level performance evaluation of a two-relay cooperative random access wireless system
TL;DR: This paper investigates the benefits from the deployment of a second relay in a wireless networks system, in which the users are divided into clusters, each being served by one relay, and shows its advantages in terms of aggregate and throughput per user.
Journal ArticleDOI
Lossy Compression for Compute-and-Forward in Limited Backhaul Uplink Multicell Processing
TL;DR: In this article, two lattice-based coding schemes are proposed for cloud radio access networks with multiple base stations, acting as relay nodes, connected to a central processor via error-free rate-limited backhaul links.
Journal ArticleDOI
Performance Analysis and Optimization of the Coverage Probability in Dual Hop LoRa Networks With Different Fading Channels
TL;DR: The findings show that the impact of imperfect orthogonality is not non-negligible, along with the intra-SF interference and the coverage probability is significantly improved when the location of relay is optimized.
Proceedings ArticleDOI
Generalized relaying in the presence of interference
TL;DR: Capacity gains from cooperation in a network with two source-destination pairs and a relay are analyzed and the obtained results demonstrate the gains from interference forwarding in certain scenarios.
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.