Multiple-user communication
From MaRDI portal
Publication:1147675
DOI10.1007/BF01088987zbMath0449.94005MaRDI QIDQ1147675
Publication date: 1980
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
communication networkscommon informationchannel capacityside informationcorrelated information sourcesmulti-user communicationmulti-component channels
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Measures of information, entropy (94A17) Information theory (general) (94A15) Channel models (including quantum) in information and communication theory (94A40) Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The capacity of a channel with two senders and two receivers
- Une remarque sur les isomorphismes de schemas de Bernoulli qui preservent certains facteurs
- Remarques sur les systèmes dynamiques donnes avec plusieurs facteurs
- On Sequences of Pairs of Dependent Random Variables
- On measures of dependence
- A note on a partial ordering for communication channels
- Communication Theory of Secrecy Systems*
- Cooperative broadcasting
- Source Coding for a Simple Network
- Communication networks: Message path delays
- The capacity region of a multiple-access discrete memoryless channel can increase with feedback (Corresp.)
- On a problem by Ahlswede regarding the capacity region of certain multiway channels
- A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)
- Entropy inequalities for discrete channels
- The common information of two dependent random variables
- A simple converse for broadcast channels with additive white Gaussian noise (Corresp.)
- A case where interference does not reduce capacity (Corresp.)
- Random coding theorems for the general discrete memoryless broadcast channel
- On source coding with side information at the decoder
- Source coding with side information and a converse for degraded broadcast channels
- An achievable rate region for the broadcast channel
- The Wire-Tap Channel
- Coding for a multiple-access channel
- The rate-distortion function for source coding with side information at the decoder
- The capacity region of a channel with s senders and r receivers
- The zero-error side information problem and chromatic numbers (Corresp.)
- A conditional entropy bound for a pair of discrete random variables
- Basic limits on protocol information in data communication networks
- Values and Bounds for the Common Information of Two Discrete Random Variables
- Packet Switching in Radio Channels: Part I--Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics
- Packet Switching in Radio Channels: Part II--The Hidden Terminal Problem in Carrier Sense Multiple-Access and the Busy-Tone Solution
- Every bad code has a good subcode: A local converse to the coding theorem
- Bounds on conditional probabilities with applications in multi-user communication
- General broadcast channels with degraded message sets
- A survey of multi-way channels in information theory: 1961-1976
- Recent results in the Shannon theory
- A theorem on the entropy of certain binary sequences and applications--I
- A theorem on the entropy of certain binary sequences and applications--II
- Signal detection in the presence of multiple-access noise
- A Coding Theorem for Multiple Access Channels With Correlated Sources
- A new class of lower bounds to information rates of stationary sources via conditional rate-distortion functions
- Loss in information transmission through two-way channels
- The convolution inequality for entropy powers
- Networks of Gaussian channels with applications to feedback systems
- Broadcast channels
- Three-terminal communication channels
- Noiseless coding of correlated information sources
- Coding for and decomposition of two-way channels
This page was built for publication: Multiple-user communication
