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
A Low Complexity Protocol for Relay Channels Employing Rateless Codes and Acknowledgement
TL;DR: A low complexity communication protocol for relay channels that can achieve a significant rate reliably even when a code word spans only finite number of fading blocks on average, and achieves a significant information rate with asymptotically zero error probability when the number of information bits represented by a code words increases to infinity.
Proceedings ArticleDOI
On message lengths for noisy network coding
Gerhard Kramer,Jie Hou +1 more
TL;DR: This work has shown that classic “short”-message encoding combined with backward decoding achieves the same rates as QMF and NNC.
Journal ArticleDOI
Deadline-aware scheduling of cooperative relayers in TDMA-based wireless industrial networks
TL;DR: This paper introduces two different Markov Decision Process (MDP) based formulations for schedule computation of the restricted TDMA relay scheduling problem, and suggests and numerically investigates a range of algorithms and heuristics that represent different trade-offs between achievable performance and computational complexity.
Journal ArticleDOI
Maximizing Lifetime in Relay Cooperation Through Energy-Aware Power Allocation
TL;DR: PLT and MWTP are compared through analysis and simulation, and it is demonstrated that both result in lifetime performance close to that of the noncausal optimal solution, and that they significantly outperform the conventional strategy of minimizing the total power per transmission.
Journal ArticleDOI
Analysis of Multihop Relaying Networks: Communication Between Range-Limited and Cooperative Nodes
TL;DR: The quality of service (QoS) of the single- input multiple-output (SIMO) and multiple-input multiple- output (MIMO) multihop networks are studied, and their performance is compared analytically with each other.
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.