Characterising Probability Distributions via Entropies

被引:0
|
作者
Thakor, Satyajit [1 ]
Chan, Terence [2 ]
Grant, Alex [3 ]
机构
[1] Indian Inst Technol Mandi, Mandi, Himachal Prades, India
[2] Univ South Australia, Adelaide, SA, Australia
[3] Myriota Pty Ltd, Adelaide, SA, Australia
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Characterising the capacity region for a network can be extremely difficult, especially when the sources are dependent. Most existing computable outer bounds are relaxations of the Linear Programming hound. One main challenge to extend linear program bounds to the case of correlated sources is the difficulty (or impossibility) of characterising arbitrary dependencies via entropy functions. This paper tackles the problem by addressing how to use entropy functions to characterise correlation among sources.
引用
收藏
页码:453 / 457
页数:5
相关论文
共 50 条