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

指数编码的对偶码和完整性间隔界

Duality Codes and the Integrality Gap Bound for Index Coding

Hao Yu, Michael J. Neely

摘要:

本文考虑了一个基站,通过编码传输序列向多个接收器提供数据包。所有的接收器都能听到同样的信号。每个接收机可能已经具有一些分组作为辅助信息,并且请求分组的另一子集。这个问题被称为索引编码问题,可以用一个二分有向图来表示。一个整数线性规划的开发,提供了一个下限的最小传输次数所需的任何编码算法。相反,它的线性规划松弛示出提供一个上限,这是可以实现的一个简单的形式的向量线性编码。因此,信息论的最优解是有界的整数规划和线性松弛之间的完整性差距。在有向图为平面结构的特殊情况下,证明了整性间隙为零,从而获得了精确最优性。最后,对于非平面问题,构造了一个增强的整数规划,提供了一个较小的完整性差距。这个问题的对偶对应于一个更复杂的部分团编码策略,里德-所罗门擦除码之间的时间共享。这项工作阐明了整数规划和线性松弛之间的索引编码,对偶和完整性差距之间的关系。

英文摘要:

This paper considers a base station that delivers packets to multiple receivers through a sequence of coded transmissions. All receivers overhear the same transmissions. Each receiver may already have some of the packets as side information, and requests another subset of the packets. This problem is known as the index coding problem and can be represented by a bipartite digraph. An integer linear program is developed that provides a lower bound on the minimum number of transmissions required for any coding algorithm. Conversely, its linear programming relaxation is shown to provide an upper bound that is achievable by a simple form of vector linear coding. Thus, the information theoretic optimum is bounded by the integrality gap between the integer program and its linear relaxation. In the special case when the digraph has a planar structure, the integrality gap is shown to be zero, so that exact optimality is achieved. Finally, for non-planar problems, an enhanced integer program is constructed that provides a smaller integrality gap. The dual of this problem corresponds to a more sophisticated partial clique coding strategy that time-shares between Reed-Solomon erasure codes. This work illuminates the relationship between index coding, duality, and integrality gaps between integer programs and their linear relaxations.

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

↑