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
Error rate analysis of full-duplex relaying
TL;DR: This work conducts a bit error rate (BER) analysis of a full-duplex relaying scheme that employs binary phase shift keying (BPSK) and a single decode-and-forward relay, demostrating inferior performance as compared to the HD protocol, as well as zero diversity order due to the existence of self-interference at the relay and destination.
Journal ArticleDOI
Design and Analysis of Relay-aided Broadcast using Binary Network Codes
TL;DR: This work considers a base-station broadcasting a set of order-insensitive packets to a user population over packet-erasure channels and proposes relay-aided transmission using instantaneously-decodable binary network coding, which has the benefits of minimal decoding delay and low complexity.
Posted Content
Parity Forwarding for Multiple-Relay Networks
Peyman Razaghi,Wei Yu +1 more
TL;DR: This protocol improves the previously known achievable rate of the decode-and-forward (DF) strategy for multirelay networks by allowing relays to decode only a selection of messages from relays with strong links to it.
Proceedings ArticleDOI
Space-Time Communication Protocols for N-Way Relay Networks
Tao Cui,Tracey Ho,Jorg Kliewer +2 more
TL;DR: This paper addresses communication protocols for N-way relay networks with M antennas at the relay and a single antenna at the N source terminals with amplify-and-forward (AF), decode-and -forward (DF), and compress-and'-forward (CF) strategies, and proposes two new relaying protocols.
Journal ArticleDOI
Distributed Space-Frequency Coding over Broadband Relay Channels
Karim G. Seddik,K. J. Ray Liu +1 more
TL;DR: The proposed DSFCs are designed to achieve the frequency and cooperative diversities of the wireless relay channels and derive sufficient conditions for the proposed code structures at the source and relay nodes to achieve full diversity of order NL.
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.