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

熵函数与网络码的对偶性

Dualities Between Entropy Functions and Network Codes

Terence Chan, Alex Grant

摘要:

本文给出了熵函数与网络码之间的一种新的对偶关系。给定一个定义在$N$随机变量的所有真子集上的函数$g\geq 0$,我们给出了一个网络多播问题可解的构造当且仅当$g$是熵的.底层网络拓扑是固定的,组播问题仅通过边缘容量和源速率依赖于$g$。放松$g$的定义域是随机变量子集的要求,我们得到了一个类似的对偶之间的多拟阵和线性规划界。这些对偶结果提供了一个替代证明的线性(和阿贝尔)网络代码的不足,并展示了实用的非香农不等式收紧网络编码容量区域的外部边界。

英文摘要:

This paper provides a new duality between entropy functions and network codes. Given a function $g\geq 0$ defined on all proper subsets of $N$ random variables, we provide a construction for a network multicast problem which is solvable if and only if $g$ is entropic. The underlying network topology is fixed and the multicast problem depends on $g$ only through edge capacities and source rates. Relaxing the requirement that the domain of $g$ be subsets of random variables, we obtain a similar duality between polymatroids and the linear programming bound. These duality results provide an alternative proof of the insufficiency of linear (and abelian) network codes, and demonstrate the utility of non-Shannon inequalities to tighten outer bounds on network coding capacity regions.

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

↑