Channel Resolvability in Information Theory
Beschreibung
Channel resolvability, introduced in [1] based on ideas from [2], measures how much needs to be transmitted to approximate a random variable at the channel output accurately.
Not only does it have deep ties to the capacity of a channel, but it is also an important tool in information theoretic secrecy, e.g., when communication should be hidden.
The goal of this topic is to understand and present the concept of resolvability, to outline it's relation to other channel properties such as capacity, and to illustrate its use in information theory by means of an exemplary application.
- Han, Verdu. 1993. Approximation Theory of Output Statistics. https://doi.org/10.1109/18.256486
- Wyner. 1975. The common information of two dependent random variables. https://doi.org/10.1109/TIT.1975.1055346
Voraussetzungen
- Information Theory
- Multi-User Information Theory is helpful but not necessary