State Amplification
arXiv:cs/0703005 · doi:10.1109/TIT.2008.920242
Abstract
We consider the problem of transmitting data at rate R over a state dependent channel p(y|x,s) with the state information available at the sender and at the same time conveying the information about the channel state itself to the receiver. The amount of state information that can be learned at the receiver is captured by the mutual information I(S^n; Y^n) between the state sequence S^n and the channel output Y^n. The optimal tradeoff is characterized between the information transmission rate R and the state uncertainty reduction rate Δ, when the state information is either causally or noncausally available at the sender. This result is closely related and in a sense dual to a recent study by Merhav and Shamai, which solves the problem of masking the state information from the receiver rather than conveying it.
arXiv comment9 pages, 4 figures, submitted to IEEE Trans. Inform. Theory, revised
References in corpus (1)
Cited by in corpus (16)
- High-Dimensional Gaussian Graphical Model Selection: Walk Summability and Local Separation Criterion
- Rate and Detection-Error Exponent Tradeoff for Joint Communication and Sensing of Fixed Channel States
- The finite-dimensional Witsenhausen counterexample
- Information Masking and Amplification: The Source Coding Setting
- On Data-Processing and Majorization Inequalities for -Divergences with Applications
- Correlation between Channel State and Information Source with Empirical Coordination Constraint
- Information embedding and the triple role of control
- Information embedding meets distributed control
- Fundamental Limits of Multiple-Access Integrated Sensing and Communication Systems
- Bottleneck Problems: Information and Estimation-Theoretic View
- Generalizations of Fano's Inequality for Conditional Information Measures via Majorization Theory
- Gaussian State Amplification with Noisy State Observations
- Coding With Action-dependent Side Information and Additional Reconstruction Requirements
- Information theoretic limits of state-dependent networks
- Estimation with a helper who knows the interference
- On the Capacity of the Dirty Paper Channel with Fast Fading and Discrete Channel States