Linear information coupling problems
Author(s)
Huang, Shao-Lun; Zheng, Lizhong
DownloadZheng_Linear information.pdf (1.318Mb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
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 to each other. Under this assumption, the K-L divergence is reduced to the squared Euclidean metric in an Euclidean space. Moreover, we construct the notion of coordinate and inner product, which will facilitate solving communication problems. We will also present the application of this approach to the point-to-point channel and the general broadcast channel, which demonstrates how our technique simplifies information theory problems.
Date issued
2012-07Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Research Laboratory of ElectronicsJournal
Proceedings of the 2012 IEEE International Symposium on Information Theory Proceedings
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Huang, Shao-Lun, and Lizhong Zheng. “Linear Information Coupling Problems.” 2012 IEEE International Symposium on Information Theory Proceedings (July 2012).
Version: Original manuscript
ISBN
978-1-4673-2579-0
978-1-4673-2580-6
978-1-4673-2578-3
ISSN
2157-8095