论文标题
网络解码
Network Decoding
论文作者
论文摘要
我们考虑在编码的多播网络中的错误控制问题，重点是仅在网络边缘的适当子集上发生错误的情况。我们通过对抗性噪声对此问题进行建模，并提出了一个正式的框架和一系列技术，以获得网络（1-SHOT）容量上的上限和下限，从而改善了当前最著名的结果。特别是，我们表明，在受限制的对手存在下，传统的剪裁界限并不是很紧，并且这些界限的非电密性是由对噪声施加的限制造成的（而不是像一个人可能期望的那样，由字母表大小）引起。我们还表明，与网络编码中的典型情况形成鲜明对比，无法通过将线性网络编码与端到端通道编码相结合，即使基本网络具有单个源和一个终端，也无法实现容量。我们最终说明了如何在我们检查的方案中实现能力，表现出能力实现方案和各种网络的下限是必要的。
We consider the problem of error control in a coded, multicast network, focusing on the scenario where the errors can occur only on a proper subset of the network edges. We model this problem via an adversarial noise, presenting a formal framework and a series of techniques to obtain upper and lower bounds on the network's (1-shot) capacity, improving on the best currently known results. In particular, we show that traditional cut-set bounds are not tight in general in the presence of a restricted adversary, and that the non-tightness of these is caused precisely by the restrictions imposed on the noise (and not, as one may expect, by the alphabet size). We also show that, in sharp contrast with the typical situation within network coding, capacity cannot be achieved in general by combining linear network coding with end-to-end channel coding, not even when the underlying network has a single source and a single terminal. We finally illustrate how network decoding techniques are necessary to achieve capacity in the scenarios we examine, exhibiting capacity-achieving schemes and lower bounds for various classes of networks.
