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
Efficient Message Relaying for Wireless User Cooperation: Decode-Amplify-Forward (DAF) and Hybrid DAF and Coded-Cooperation
Xingkai Bao,Jing Li +1 more
TL;DR: A hybrid scheme of DAF and coded cooperation (DAF-CC), implemented through simple time-sharing, and the information-theoretic achievable rates of these schemes are formulated for channels with binary inputs and Gaussian outputs are discussed.
Posted Content
Opportunistic Cooperation in Cognitive Femtocell Networks
Rahul Urgaonkar,Michael J. Neely +1 more
TL;DR: In this article, the authors investigate opportunistic cooperation between unlicensed secondary users and legacy primary users in a cognitive radio network, where a secondary user can cooperatively transmit with the primary user in order to improve the latter's effective transmission rate.
Journal ArticleDOI
On Design of Collaborative Beamforming for Two-Way Relay Networks
Meng Zeng,Rui Zhang,Shuguang Cui +2 more
TL;DR: This paper studies the achievable rate region for an amplify-and-forward (AF)-based two-way relay network with collaborative beamforming and proposes the partially distributed algorithms to implement the optimal beamforming, where each relay node only needs the local channel information and one global parameter.
Journal ArticleDOI
The Amplify-and-Forward Half-Duplex Cooperative System: Pairwise Error Probability and Precoder Design
TL;DR: Simulations indicate that the proposed precoder designs greatly improve the performance of the cooperative system and are proposed a design of unitary precoder for the Cooperative system to achieve the full diversity gain function.
Journal ArticleDOI
Side information aware coding strategies for sensor networks
TL;DR: Coding strategies for estimation under communication constraints in tree-structured sensor networks are developed based on a generalization of Wyner-Ziv source coding with decoder side information, which promotes the flexibility, robustness, and scalability that wireless sensor networks need to operate in uncertain, changing, and resource-constrained environments.
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.