This work considers the one-shot capacity of communication networks subject to adversarial noise affecting a subset of network edges. In particular, we examine previously-established upper bounds on one-shot capacity. We introduce the Diamond Network as a minimal example to show that known cut-set bounds are not sharp in general. We then give a capacity-achieving scheme for the Diamond Network that implements an adversary detection strategy. Finally, we give a sufficient condition for tightness of the Singleton Cut-Set Bound in a family of two-level networks.
翻译:这项工作考虑到受对立噪音影响的通信网络的一发能力,特别是我们检查先前确定的一发能力上限,我们采用钻石网络作为最起码的例子,表明已知的切开界限一般并不尖锐,然后我们给执行对立探测战略的钻石网络一个能力实现计划,最后,我们为单子断线网在双层网络家庭中的紧凑性提供了充分的条件。