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
Distributed Concatenated Alamouti Codes for Two-Way Relaying Networks
TL;DR: The asymptotic formula of exact symbol error probability (SEP) for a quadrature amplitude modulation (QAM) constellation with the maximum likelihood (ML) detector is derived and shows that the full diversity gain function is achieved and proportional to ln SNR /SNR2.
Proceedings ArticleDOI
Wireless network-level partial relay cooperation
TL;DR: The benefits of using one user of a two-user random access system to relay traffic of the other user to improve the efficiency of the system.
Proceedings ArticleDOI
Low-Complexity Cooperative Coding for Sensor Networks using Rateless and LDGM Codes
TL;DR: A scheme for cooperative error-control coding, using rateless and low-density generator-matrix codes, for sensor networks, and the generalization of the framework to a multi-node system is discussed.
Journal ArticleDOI
Maximum-Throughput Irregular Distributed Space-Time Code for Near-Capacity Cooperative Communications
TL;DR: Numerical results show the proficiency of the joint source-and-relay mode design procedure, demonstrating that the proposed Ir-DST coding scheme is capable of near-capacity cooperative communications and of maximizing the effective throughput.
Proceedings ArticleDOI
Multi-hop communication is order-optimal for homogeneous sensor networks
TL;DR: The main goal of this paper is to show that multi-hop single-user communication achieves the per node transport capacity of /spl Theta/((ln N)/N) in homogeneous sensor networks, making it order-optimal.
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.