Linear information coupling problems
Many network information theory problems face the similar difficulty of single letterization. We argue that this is due to the lack of a geometric structure on the space of probability distribution. In this paper, we develop such a structure by assuming that the distributions of interest are close t...
Main Authors: | Huang, Shao-Lun, Zheng, Lizhong |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2014
|
Online Access: | http://hdl.handle.net/1721.1/91014 https://orcid.org/0000-0002-6108-0222 |
Similar Items
-
Euclidean Information Theory of Networks
by: Huang, Shao-Lun, et al.
Published: (2022) -
Euclidean Information Theory of Networks
by: Huang, Shao-Lun, et al.
Published: (2021) -
An Information-theoretic Approach to Unsupervised Feature Selection for High-Dimensional Data
by: Huang, Shao-Lun, et al.
Published: (2021) -
An information-theoretic approach to unsupervised feature selection for high-dimensional data
by: Huang, Shao-Lun, et al.
Published: (2021) -
A Local Characterization for Wyner Common Information
by: Huang, Shao-Lun, et al.
Published: (2021)