Characterising Probability Distributions via Entropies
Information Theory
2016-02-15 v2 math.IT
Abstract
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 bound. 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.
Cite
@article{arxiv.1602.03618,
title = {Characterising Probability Distributions via Entropies},
author = {Satyajit Thakor and Terence Chan and Alex Grant},
journal= {arXiv preprint arXiv:1602.03618},
year = {2016}
}
Comments
5 pages, 1 figure