Abstract
At the present state of development of multiuser Shannon theory, the main interest is in single-letter characterizations of achievable rate regions (capacity regions) of various source (channel) networks, such as source coding with side information, multiple descriptions, and broadcast channels. The mathematical background of most such problems is very similar, namely, an entropy or image size characterization in the sense of [1].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
I. Csiszár and J. Kömer, Information Theory: Coding Theorems for Discrete Memoryless Systems, Academic, New York, 1981.
R. Ahlswede and I. Csiszár, “Hypothesis Testing with Communication Constraints,” IEEE Trans. Inf. Theory, July 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Csiszár, I. (1987). Some Basic Mathematical Problems of Multiuser Shannon Theory. In: Cover, T.M., Gopinath, B. (eds) Open Problems in Communication and Computation. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4808-8_3
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4808-8_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-9162-6
Online ISBN: 978-1-4612-4808-8
eBook Packages: Springer Book Archive