Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes (2212.00060v3)

Abstract: 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.