DocumentCode :
56947
Title :
Conditional Information Inequalities for Entropic and Almost Entropic Points
Author :
Kaced, Tarik ; Romashchenko, Andrei
Author_Institution :
Inst. ofNetwork Coding, Chinese Univ. of Hong Kong, Shatin, China
Volume :
59
Issue :
11
fYear :
2013
fDate :
Nov. 2013
Firstpage :
7149
Lastpage :
7167
Abstract :
We study conditional linear information inequalities, i.e., linear inequalities for Shannon entropy that hold for distributions whose joint entropies meet some linear constraints. We prove that some conditional information inequalities cannot be extended to any unconditional linear inequalities. Some of these conditional inequalities hold for almost entropic points, while others do not. We also discuss some counterparts of conditional information inequalities for Kolmogorov complexity.
Keywords :
computational complexity; information theory; Kolmogorov complexity; Shannon entropy; conditional linear information inequalities; entropic points; joint entropies; linear constraints; Channel coding; Complexity theory; Cramer-Rao bounds; Entropy; Random variables; Standards; Almost entropic points; Kolmogorov complexity; conditional inequalities; information inequalities; non-Shannon-type inequalities;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2013.2274614
Filename :
6567916
Link To Document :
بازگشت