Information Inequalities are Not Closed Under Polymatroid Duality.
IEEE Transactions on Information Theory（2018）
摘要
We use the notion of polymatroid duality to define the formal dual of an information inequality. We use it to show that the closure of the entropy region for n ≥ 5 is not closed under polymatroid duality.
更多查看译文
关键词
Cramer-Rao bounds,Entropy,Channel coding,Cryptography,Random variables,Probability distribution
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要