2013/09/06 by Satyajit Thakor, Thakor, Satyajit, Terence Chan +3
Computer Science · Engineering · Mathematics · #Advanced Memory and Neural Computing #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1309.1517
arxiv created 2013/09/06 · openalex publication_date 2013/09/06 · arxiv updated 2013/09/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Characterizing 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 characterizing 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 programming bounds is the difficulty (or impossibility) of characterizing arbitrary dependencies via entropy functions. This paper tackles the problem by answering the question of how well entropy functions can characterize correlation among sources. We show that by using carefully chosen auxiliary random variables, the characterization can be fairly "accurate".