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
Posted Content
Relay Channels with Confidential Messages
TL;DR: This paper studies the coding problem of the relay channel under the situation that some of transmitted messages are confidential to the relay and defines the rate region in the case of deterministic encoder and calls it the stochastic rate region.
Journal ArticleDOI
Capacity Approaching Turbo Coding For Half-Duplex Relaying
Zheng Zhang,Tolga M. Duman +1 more
TL;DR: This paper develops capacity-approaching turbo-coding schemes for half-duplex relay systems as an extension of previous work on coding for full-duple relays, and observes that the proposed scheme is promising to approach the corresponding information theoretical limits (bounds).
Journal ArticleDOI
A Unified Approach to Hybrid Coding
TL;DR: A generalized hybrid coding technique is proposed for communication over discrete memoryless and Gaussian systems, and its utility is demonstrated via three examples-lossy joint source-channel coding over multiple access channels, channel coding over two-way relay channels, andChannel coding over diamond networks.
Journal ArticleDOI
Persistent RCSMA: A MAC Protocol for a Distributed Cooperative ARQ Scheme in Wireless Networks
TL;DR: The persistent relay carrier sensing multiple access (PRCSMA) protocol is presented in this paper as a novel medium access control protocol that allows for the execution of a distributed cooperative automatic retransmission request (ARQ) scheme in IEEE 802.11 wireless networks.
Book
New Directions In Statistical Signal Processing: From Systems To Brains
TL;DR: Signal processing and neural computation have separately and significantly influenced many disciplines, but the cross-fertilization of the two fields has begun only recently as mentioned in this paper, as we see highly sophisticated kinds of signal processing and elaborate hierachical levels of neural computation performed side by side in the brain.
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.