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
Quantize-map-forward (QMF) relaying: an experimental study
TL;DR: It is found that QMF is a competitive scheme to the other two, offering in some cases up to 12% throughput benefits and up to 60% improvement in frame error-rates over the next best scheme.
Journal ArticleDOI
Dynamic Decode-and-Forward Relaying using Raptor Codes
TL;DR: Numerical results for exemplary three-node and four-node relay networks show that the proposed mixed combining provides significant gains in achievable data rate and that Raptor codes with a fixed degree distribution are able to realize these gains and to approach closely the constrained-capacity limits.
Journal ArticleDOI
Capacity analysis of power line communication point-to-point and relay channels
TL;DR: A capacity analysis for broadband power line communication (PLC) channels, impaired by the Bernoulli–Gaussian impulsive noise, exploiting both orthogonal frequency division multiplexing (OFDM) and single‐carrier frequency‐domain equalisation (SC‐FDE) techniques is presented.
Proceedings ArticleDOI
GABBA Codes: Generalized Full-Rate Orthogonally Decodable Space-Time Block Codes
TL;DR: The comparison reveals that the linear orthogonal decoder achieves nearly the same performance of the ML receiver, despite its remarkably low complexity.
Journal ArticleDOI
Whether and where to code in the wireless packet erasure relay channel
TL;DR: This paper explores the strategic use of network coding in the wireless packet erasure relay channel and shows that coding at the relay alone while operating in a rateless fashion is neither throughput nor energy efficient.
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.