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
Approximate Capacity Region for the Symmetric Gaussian Interference Channel With Noisy Feedback
TL;DR: This paper considers the two-user linear deterministic interference channel with noisy feedback, as a stepping stone to characterize the approximate capacity region for the symmetric Gaussian interference channel without feedback, and develops a novel converse outer bounding technique.
Proceedings ArticleDOI
Joint Adaptive Modulation-Coding and Cooperative ARQ for Wireless Relay Networks
TL;DR: The results indicate that utilizing cooperative ARQ as a retransmission strategy, noticeably enhances the spectral efficiency compared with the system that employs AMC alone at the physical layer.
Journal ArticleDOI
Performance analysis of cooperative multi-carrier relay-based UAV networks over generalized fading channels
TL;DR: The outage probability in a network of cooperative unmanned airborne vehicles (UAVs) over generalized fading channels is studied analytically using finite mixture with expectation maximization technique.
Proceedings ArticleDOI
Achievable Rates of Compress-and-Forward Cooperative Relaying on Gaussian Vector Channels
TL;DR: This paper derives achievable rates on Gaussian vector channels with cooperative C&F relaying from previous information-theoretic results from the scalar to the vector Gaussian channel, and shows that the maximization of the C &F mutual information is also a convex problem.
Dissertation
Network coded wireless architecture
Dina Katabi,Sachin Katti +1 more
TL;DR: The systems presented in this dissertation were the first to integrate network coding into the wireless network stack, showing that network coding can be made practical and an integral part of the network architecture.
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.