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

Titelangaben

Kurz, Sascha:
Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes.
In: Designs, Codes and Cryptography. Bd. 93 (2025) . - S. 409-421.
ISSN 1573-7586
DOI: https://doi.org/10.1007/s10623-024-01485-9

Volltext

Link zum Volltext (externe URL):

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.