arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.03513cs.ITmath.IT
收藏

函数依赖结构的最小Shannon型不等式集

A Minimal Set of Shannon-type Inequalities for Functional Dependence Structures

Satyajit Thakor, Terence Chan, Alex Grant

摘要:

Shannon型不等式的最小集合(称为基本不等式)在确定一个给定的不等式是否是Shannon型不等式中起着核心作用。经常会出现这样的情况,即需要检查给定的不等式是否是约束香农型不等式。基本不等式的另一个重要应用是制定和计算多源多汇网络编码容量的香农外界。在这个公式下,它是可行的源速率的区域受到感兴趣的元素不等式和网络编码约束。因此,它是根本利益,以确定元素之间的不平等引起的冗余时,给出了一组功能依赖约束。在本文中,我们刻画了一个最小集的Shannon型不等式时,功能依赖约束。

英文摘要:

The minimal set of Shannon-type inequalities (referred to as elemental inequalities), plays a central role in determining whether a given inequality is Shannon-type. Often, there arises a situation where one needs to check whether a given inequality is a constrained Shannon-type inequality. Another important application of elemental inequalities is to formulate and compute the Shannon outer bound for multi-source multi-sink network coding capacity. Under this formulation, it is the region of feasible source rates subject to the elemental inequalities and network coding constraints that is of interest. Hence it is of fundamental interest to identify the redundancies induced amongst elemental inequalities when given a set of functional dependence constraints. In this paper, we characterize a minimal set of Shannon-type inequalities when functional dependence constraints are present.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑