非分离网络在受限对抗者下的容量
Capacity of Non-Separable Networks with Restricted Adversaries
AI总结:
本文研究了受限对抗者下的网络容量问题,提出了一种2级网络家族的精确容量计算方法,并改进了下限,同时探讨了网络在不同度量下的分离性。
摘要:
本文研究了在通信网络中存在受限对抗者的情况下单源多播问题。当对抗者被限制只能在预设的边子集中操作时,经典切割集界限不再准确,通常需要联合设计外码和内(网络)码才能达到容量。这与无限制对抗者的案例形成鲜明对比,后者可以通过结合线性网络编码与适当的秩度量外码来实现容量。基于网络解码框架,我们确定了其中一种基本的2级网络家族的精确单次容量,并改进了另一种此类家族目前最好的下限。此外,我们引入了一种新的网络家族,它扩展了多个已知例子,并推导了部分容量结果,展示了在受限对抗者设置中出现的各种现象。最后,我们研究了网络在秩度量和汉明度量下的分离性概念。
英文摘要:
This paper investigates the problem of single-source multicasting over a communication network in the presence of restricted adversaries. When the adversary is constrained to operate only on a prescribed subset of edges, classical cut-set bounds are no longer tight, and achieving capacity typically requires a joint design of the outer code and the inner (network) code. This stands in sharp contrast with the case of unrestricted adversaries, where capacity can be achieved by combining linear network coding with appropriate rank-metric outer codes. Building on the framework of network decoding, we determine the exact one-shot capacity of one of the fundamental families of 2-level networks introduced in [4], and we improve the best currently known lower bounds for another such family. In addition, we introduce a new family of networks that generalizes several known examples, and derive partial capacity results that illustrate a variety of phenomena that arise specifically in the restricted-adversary setting. Finally, we investigate the concept of separability of networks with respect to both the rank metric and the Hamming metric.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。