Multiple user information theory
- 1 January 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 68 (12) , 1466-1483
- https://doi.org/10.1109/proc.1980.11897
Abstract
A unified framework is given for multiple user information networks. These networks consist of several users communicating to one another in the presence of arbitrary interference and noise. The presence of many senders necessitates a tradeoff in the achievable information transmission rates. The goal is the characterization of the capacity region consisting of all achievable rates. The focus is on broadcast, multiple access, relay, and other channels for which the recent theory is relativdy well developed. A discussion of the Gaussian version of these channels demonstrates the concreteness of the encoding and decoding necessary to achieve optimal information flow. We also offer speculations about the form of a general theory of information flow in networks.Keywords
This publication has 88 references indexed in Scilit:
- The capacity of the semideterministic relay channel (Corresp.)IEEE Transactions on Information Theory, 1982
- A proof of Marton's coding theorem for the discrete memoryless broadcast channel (Corresp.)IEEE Transactions on Information Theory, 1981
- Towards a general theory of source networksIEEE Transactions on Information Theory, 1980
- Optimum linear coding in continuous-time communication systems with noisy side information at the decoder (Corresp.)IEEE Transactions on Information Theory, 1979
- The feedback capacity of degraded broadcast channels (Corresp.)IEEE Transactions on Information Theory, 1978
- Images of a set via two channels and their role in multi-user communicationIEEE Transactions on Information Theory, 1977
- The zero-error side information problem and chromatic numbers (Corresp.)IEEE Transactions on Information Theory, 1976
- A case where interference does not reduce capacity (Corresp.)IEEE Transactions on Information Theory, 1975
- On source coding with side information at the decoderIEEE Transactions on Information Theory, 1975
- A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.)IEEE Transactions on Information Theory, 1975