论文标题
与固定字母大小的钻石网络相关的无限网络家族的能力
Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes
论文作者
论文摘要
我们考虑在网络中只能在网络边缘的适当子集上发生错误的网络中错误纠正问题。为了概括所谓的钻石网络，我们考虑了固定字母尺寸的网络（1-shot）容量的下限和上限。
We consider the problem of error correction in a network where the errors can occur only on a proper subset of the network edges. For a generalization of the so-called Diamond Network we consider lower and upper bounds for the network's (1-shot) capacity for fixed alphabet sizes.
