  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.
