Capacity Bounds for Networks With Correlated Sources and Characterisation of Distributions by Entropies

DOI10.1109/TIT.2017.2681078zbMATH Open1369.94414arXiv1607.02822OpenAlexW2477751107MaRDI QIDQ5352602FDOQ5352602

Authors: Satyajit Thakor, Terence H. Chan, Alex Grant 

Publication date: 8 September 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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" Using such auxiliary random variables we also give implicit and explicit outer bounds on the capacity of networks with correlated sources. The characterisation of correlation or joint distribution via Shannon entropy functions is also applicable to other information measures such as Renyi entropy and Tsallis entropy.

Full work available at URL: https://arxiv.org/abs/1607.02822

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Cited In (3)

• Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation
• Improving the linear programming technique in the search for lower bounds in secret sharing
• Common information, matroid representation, and secret sharing for matroid ports

This page was built for publication: Capacity Bounds for Networks With Correlated Sources and Characterisation of Distributions by Entropies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5352602)