Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes

TL;DR

This paper investigates the capacity limits of a generalized diamond network with restricted error locations, providing bounds for the network's one-shot capacity over fixed alphabet sizes.

Contribution

It introduces bounds on the capacity of a generalized diamond network with errors confined to certain edges, extending previous network error correction models.

Findings

Derived lower and upper bounds for network capacity.

Analyzed capacity for fixed alphabet sizes.

Extended understanding of error correction in network structures.

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.