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.
Bayreuth , 2023 . - 14 S.

Volltext

	Format: PDF Name: Irsee6-Diamond_arxiv.pdf Version: Veröffentlichte Version Verfügbar mit der Lizenz Creative Commons BY 4.0: Namensnennung
	Download (497kB)

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.