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
Decentralized Learning-Based Relay Assignment for Cooperative Communications
TL;DR: This paper gives source nodes self-optimizing and self-learning abilities and enables them to autonomously select relay nodes in cooperative networks, and evaluates the performance of DLRA in two different network systems: a cooperative ad hoc network and a Long-Term Evolution-Advanced relay network.
Journal ArticleDOI
On Instantaneous Relaying
TL;DR: It is illustrated that the proposed PL relaying scheme can improve on sophisticated block Markov encoding when the source-relay link is ill-conditioned (relative to other links) and can work at rates close to those achieved by side-information encoding, but at a much lower complexity.
Proceedings ArticleDOI
Optimizing Downlink Throughput with User Cooperation and Scheduling in Adaptive Cellular Networks
Ernest S. Lo,Khaled Ben Letaief +1 more
TL;DR: This work considers the downlink throughput optimization for an adaptive cellular network with both user cooperation and scheduling and shows that multiple relays can actually be supported in different timeslots concurrently with other transmissions through scheduling and the corresponding optimal relays selection and power allocation are derived.
Journal ArticleDOI
Cooperative Schemes for a Source and an Occasional Nearby Relay in Wireless Networks
Michael Katz,Shlomo Shamai +1 more
TL;DR: A wireless network is considered where a source is communicating with a remote destination, and where a relay terminal is occasionally present in close proximity to the source but without the source's knowledge.
Posted Content
Interference Channels with One Cognitive Transmitter
TL;DR: In this article, the capacity region of interference channels with one cognitive transmitter (ICOCT) where "cognitive" is defined from both the noncausal and causal perspectives is investigated.
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.