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
Compress-forward coding with BPSK modulation for the half-duplex Gaussian relay channel
TL;DR: This paper provides the achievable rate of SWCNSQ based CF relaying as a performance benchmark, and presents a practical code design using low-density parity-check (LDPC) codes for error protection at the source, and nested scalar quantization plus irregular-repeat accumulation (IRA) code codes for CF coding at the relay.
Journal ArticleDOI
Network Coded LDPC Code Design for a Multi-Source Relaying System
TL;DR: The main contribution of this work is the development of network coded multi-edge type LDPC (NCMET-LDPC) code design, which achieves better error performance than that of LDPC codes designed for the system without NC.
Journal ArticleDOI
Degrees of Freedom for MIMO Two-Way X Relay Channel
TL;DR: The upper bound on the degrees of freedom of a multiple-input multiple-output (MIMO) two-way X relay channel is shown, by applying signal alignment for network coding and joint transceiver design for interference cancellation.
Journal ArticleDOI
Spectrum sharing-based multi-hop decode-and-forward relay networks under interference constraints: Performance analysis and relay position optimization
TL;DR: In this paper, the exact closed-form expressions for outage probability and bit error rate of spectrum sharing-based multi-hop decode-and-forward (DF) relay networks in non-identical Rayleigh fading channels are derived.
Journal ArticleDOI
Relaying in the Presence of Interference: Achievable Rates, Interference Forwarding, and Outer Bounds
TL;DR: A sum-rate outer bound to the capacity region of the Gaussian interference channel with a relay is derived and compared with the achievable rate region and the results obtained demonstrate the benefits of interference forwarding at a relay.
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.