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
Proceedings ArticleDOI
The Case for Structured Random Codes in Network Communication Theorems
Bobak Nazer,Michael Gastpar +1 more
TL;DR: In this paper, the authors extend this insight to pure channel coding as well as to joint source-channel coding problems, such as the problem of reliable computation over a multiple-access channel and a multi-access network with relays.
Journal ArticleDOI
Generalized area spectral efficiency: An effective performance metric for green wireless communications
TL;DR: This paper introduces the notion of affected area to characterize the spatial property of arbitrary wireless transmissions, and defines the performance metric, generalized area spectral efficiency (GASE), to quantify the spatial spectral utilization efficiency as well as the greenness of wireless transmissions.
Journal ArticleDOI
Low-Density Graph Codes for Coded Cooperation on Slow Fading Relay Channels
TL;DR: This work derives a new code structure by extending the previously published full-diversity root-LDPC code, designed for the BF point-to-point channel, to exhibit a rate-compatibility property which is necessary for coded cooperation, and exhibits near-outage limit performance for all block lengths and for a range of coding rates.
Journal ArticleDOI
Rate performance of AF two-way relaying in low SNR region
Jingjing Ping,See Ting +1 more
TL;DR: The SNR threshold is derived, below which oneway relaying actually outperforms two-way relaying, and results show that for power-limited applications operating at extremely low SNR, two- way relaying might not necessarily be a better choice over one-way Relaying.
Proceedings ArticleDOI
Obtaining extra coding gain for short codes by block Markov superposition transmission
TL;DR: Numerical results verify the analysis and show that an extra coding gain of 6.4 dB at bit-error rate (BER) 10-5 can be obtained by BMST of the [7, 4] Hamming code.
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.