Two-user communication channels

IEEE Transactions on Information TheoryPublished 1 May 1977

Hiroshi Satō

DOI10.1109/tit.1977.1055710

Source URL

Citations206

SJR quartileQ1

SJR score1.46

SNIP1.76

TL;DR

Degraded two-user channels are introduced and studied in detail; in particular, an achievable region is obtained by combining two regions that correspond to the two different modes of transmission.

Abstract

A discrete memoryless channel with two inputs and two outputs, called a two-user channel, is studied under the communication situation where only separate messages are allowed to be sent between two source-user pairs. An outer bound to the capacity region is obtained by a method similar to that used by the author for the broadcast channel. Two extreme cases of two-user channels are discussed: separate channels and incompatible channels. Degraded two-user channels are introduced and studied in detail; in particular, an achievable region is obtained by combining two regions that correspond to the two different modes of transmission. This idea is extended to the general two-user channel where an achievable region for the general channel is obtained by random coding arguments.

Keywords

Computer ScienceBiochemistry, Genetics and Molecular BiologyEngineering

IEEE Transactions on Information TheoryBroadcast channels

1,702 Citations1972Thomas M. Cover

This work introduces the problem of a single source attempting to communicate information simultaneously to several receivers and determines the families of simultaneously achievable transmission rates for many extreme classes of channels to lead to a new approach to the compound channels problem.

Project Euclid (Cornell University)Two-way Communication Channels

798 Citations1961Claude E. Shannon

This work wishes to determine what pairs of signalling rates R1 and R2 for the two directions can be approached with arbitrarily small error probabilities.

IEEE Transactions on Information TheoryRecent results in the Shannon theory

634 Citations1974A.D. Wyner

The first part of this paper consists of short summaries of recent work in five rather traditional areas of the Shannon theory, namely: source and channel coding theorems for new situations, and calculation of source rate and channel capacity.

IEEE Transactions on Information TheoryRandom coding theorem for broadcast channels with degraded components

512 Citations1973P. Bergmans

This paper generalizes Cover's results on broadcast channels with two binary symmetric channels (BSC) to the class of degraded channels with N components, and shows a procedure to expurgate a good random broadcast code leading to a bound on the maximum probability of error.

Bell System Technical JournalA Coding Theorem for Multiple Access Channels With Correlated Sources

403 Citations1973D. Slepian, Jack K. Wolf

This paper shows that e, which depends only on the channel, is convex and gives formulas to determine it exactly and is the natural generalization of channel capacity to this situation.

The Annals of ProbabilityThe Capacity Region of a Channel with Two Senders and Two Receivers

347 Citations1974Rudolf Ahlswede

View PDF

IEEE Transactions on Information TheoryA theorem on the entropy of certain binary sequences and applications--II

255 Citations1973A.D. Wyner

A theorem concerning the entropy of a certain sequence of binary random variables is established and this result is applied to the solution of three problems in multi-user communication.

IEEE Transactions on Information TheoryAn outer bound to the capacity region of broadcast channels (Corresp.)

245 Citations1978Hiroshi Satō

An outer bound to the capacity region of broadcast channels for the transmission of separate messages is derived by taking into consideration the total throughput information rate and the fact that thecapacity region depends only on the marginal transition probabilities.

IEEE Transactions on Information TheoryA theorem on the entropy of certain binary sequences and applications--I

172 Citations1973Abraham J. Wyner, J. Ziv

IEEE Transactions on Information TheoryRandom coding theorems for the general discrete memoryless broadcast channel

98 Citations1975E. van der Meulen

Three different communication situations are considered for the general nondegraded discrete memoryless broadcast channel with two components and it is shown that in the most general situation the inner bound strictly dominates the family of rates obtained by time-sharing.