scispace - formally typeset
Open Access

Capacity theorems for the relay channel

Thomas M. Cover, +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

Cooperative transmit diversity based on superposition modulation

TL;DR: A new strategy for cooperative transmit diversity based on superposition modulation and multiuser detection is proposed that can outperform "classical" cooperative Diversity based on decode-and-forward by about 1.5-2 dB in the SNR range of interest and at the same computational complexity.
Journal ArticleDOI

An overview of cooperative communications

TL;DR: This article visits cooperative techniques, such as relay, distributed antennas systems (DAS), multicell coordination, Group Cell, Coordinated Multiple Point transmission and reception (CoMP), those turn the traditional cellular system into a cooperative system.
Journal ArticleDOI

Rethinking information theory for mobile ad hoc networks

TL;DR: For a theory to truly characterize the limits of deployed MANETs it must overcome three key roadblocks, spatial and timescale decompositions have not yet been developed for optimally modeling the spatial and temporal dynamics of wireless networks.
Book

Scaling Laws for Ad-Hoc Wireless Networks: An Information Theoretic Approach

TL;DR: This monograph addresses questions of how much information transfer they can support, as well as what the appropriate architectures and protocols are for operating them by presenting various models and results that quantify the information transport capability of wireless networks.
Book

Principles Of Cognitive Radio

TL;DR: 1. The concept of cognitive radio, capacity of cognitiveRadio networks, and Propagation issues for cognitive radio: a review.
References
More filters
Journal ArticleDOI

Noiseless coding of correlated information sources

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

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.
Related Papers (5)