Multiple-user communication

DOI10.1007/BF01088987MaRDI QIDQ1147675zbMATH OpenFDO

Authors V. V. Prelov, Sergei Gelfand

Publication date 1980

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

zbMATH Keywords

communication networksside informationcommon informationchannel capacitycorrelated information sourcesmulti-component channelsmulti-user communication

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Information theory (general) (94A15) Measures of information, entropy (94A17) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40) Rate-distortion theory in information and communication theory (94A34)

Cites work

• scientific article; zbMATH DE number 3167427 (Why is no real title available?)
• scientific article; zbMATH DE number 3497786 (Why is no real title available?)
• scientific article; zbMATH DE number 3525027 (Why is no real title available?)
• scientific article; zbMATH DE number 3438742 (Why is no real title available?)
• scientific article; zbMATH DE number 3451745 (Why is no real title available?)
• scientific article; zbMATH DE number 3316587 (Why is no real title available?)
• A Coding Theorem for Multiple Access Channels With Correlated Sources
• A case where interference does not reduce capacity (Corresp.)
• A conditional entropy bound for a pair of discrete random variables
• A new class of lower bounds to information rates of stationary sources via conditional rate-distortion functions
• A note on a partial ordering for communication channels
• A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)
• A simple converse for broadcast channels with additive white Gaussian noise (Corresp.)
• A survey of multi-way channels in information theory: 1961-1976
• A theorem on the entropy of certain binary sequences and applications--I
• A theorem on the entropy of certain binary sequences and applications--II
• An achievable rate region for the broadcast channel
• Basic limits on protocol information in data communication networks
• Bounds on conditional probabilities with applications in multi-user communication
• Broadcast channels
• Coding for a multiple-access channel
• Coding for and decomposition of two-way channels
• Communication Theory of Secrecy Systems*
• Communication networks: Message path delays
• Cooperative broadcasting
• Entropy inequalities for discrete channels
• Every bad code has a good subcode: A local converse to the coding theorem
• General broadcast channels with degraded message sets
• Loss in information transmission through two-way channels
• Networks of Gaussian channels with applications to feedback systems
• Noiseless coding of correlated information sources
• On Sequences of Pairs of Dependent Random Variables
• On a problem by Ahlswede regarding the capacity region of certain multiway channels
• On measures of dependence
• On source coding with side information at the decoder
• 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
• Random coding theorems for the general discrete memoryless broadcast channel
• Recent results in the Shannon theory
• Remarques sur les systèmes dynamiques donnes avec plusieurs facteurs
• Signal detection in the presence of multiple-access noise
• Source Coding for a Simple Network
• Source coding with side information and a converse for degraded broadcast channels
• The Wire-Tap Channel
• The capacity of a channel with two senders and two receivers
• The capacity region of a channel with s senders and r receivers
• The capacity region of a multiple-access discrete memoryless channel can increase with feedback (Corresp.)
• The common information of two dependent random variables
• The convolution inequality for entropy powers
• The rate-distortion function for source coding with side information at the decoder
• The zero-error side information problem and chromatic numbers (Corresp.)
• Three-terminal communication channels
• Une remarque sur les isomorphismes de schemas de Bernoulli qui preservent certains facteurs
• Values and Bounds for the Common Information of Two Discrete Random Variables

This page was built for publication: Multiple-user communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1147675)