Characterising correlation via entropy functions
Date
2013
Authors
Thakor, S.
Chan, T.H.L.
Grant, A.J.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
2013 IEEE Information Theory Workshop, 2013, iss.6691218, pp.1-2
Statement of Responsibility
Conference Name
2013 IEEE Information Theory Workshop (9 Sep 2013 - 13 Sep 2013 : Spain)
Abstract
Characterising the capacity region for a network can be extremely difficult. Even with independent sources, determining the capacity region can be as hard as the open problem of characterising all information inequalities. The majority of computable outer bounds in the literature are relaxations of the Linear Programming bound which involves entropy functions of random variables related to the sources and link messages. When sources are not independent, the problem is even more complicated. Extension of Linear Programming bounds to networks with correlated sources is largely open. Source dependence is usually specified via a joint probability distribution, and one of the main challenges in extending linear program bounds is the difficulty (or impossibility) of characterising arbitrary dependencies via entropy functions. This paper tackles the problem by answering the question of how well entropy functions can characterise correlation among sources. We show that by using carefully chosen auxiliary random variables, the characterisation can be fairly "accurate".
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2013 IEEE