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

网络中对抗攻击的多胞形码

Polytope Codes Against Adversaries in Networks

Oliver Kosut, Lang Tong, David Tse

摘要:

研究了攻击者控制网络中数量有限但位置未知的节点子集时的网络编码问题。这个问题被证明是更困难的,比当对手控制在网络中的边缘的给定数量,在线性代码是不够的。为了解决节点问题,引入了多胞形码类。多面体码是在整数向量域中有界多面体上运算的常数复合码。多面体结构产生额外的复杂性,但它诱导的代码向量的边缘分布的属性,使码字的有效性可以通过网络的内部节点进行检查。结果表明,多胞码实现了一类平面网络的割集界。它还表明,这个割集界并不总是紧的,并给出了一个例子网络更严格的界限。

英文摘要:

Network coding is studied when an adversary controls a subset of nodes in the network of limited quantity but unknown location. This problem is shown to be more difficult than when the adversary controls a given number of edges in the network, in that linear codes are insufficient. To solve the node problem, the class of Polytope Codes is introduced. Polytope Codes are constant composition codes operating over bounded polytopes in integer vector fields. The polytope structure creates additional complexity, but it induces properties on marginal distributions of code vectors so that validities of codewords can be checked by internal nodes of the network. It is shown that Polytope Codes achieve a cut-set bound for a class of planar networks. It is also shown that this cut-set bound is not always tight, and a tighter bound is given for an example network.

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

↑