The Mutual Information in the Vicinity of Capacity-Achieving Input Distributions

Date

2025-01-01

Author

Nakiboğlu, Barış
Cheng, Hao-Chung

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

43
views

0
downloads

Cite This

The mutual information is bounded from above by a decreasing affine function of the square of the distance between the input distribution and the set of all capacity-achieving input distributions ΠA, on small enough neighborhoods of ΠA, using an identity due to Topsoe and the Pinsker's inequality, assuming that the input set of the channel is finite and the constraint set A is polyhedral, i.e., can be described by (possibly multiple but) finitely many linear constraints. Counterexamples demonstrating nonexistence of such a quadratic bound are provided for the case of infinitely many linear constraints and the case of infinite input sets. Using Taylor's theorem with the remainder term, rather than the Pinsker's inequality and invoking Moreau's decomposition theorem the exact characterization of the slowest decrease of the mutual information with the distance to ΠA is determined on small neighborhoods of ΠA. Corresponding results for classical-quantum channels are established under separable output Hilbert space assumption for the quadratic bound and under finite-dimensional output Hilbert space assumption for the exact characterization. Implications of these observations for the channel coding problem and applications of the proof techniques to related problems are discussed.

Subject Keywords

Fisher Information, Moreau's decomposition theorem, Mutual information, polyhedral convexity, Shannon center, Taylor's theorem

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=105003151066&origin=inward
https://hdl.handle.net/11511/114816

Collections

Department of Electrical and Electronics Engineering, Article