Login
Literature by the same author
plus at Google Scholar
Bibliografische Daten exportieren		  

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

Title data

Kurz, Sascha:
Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes.
Bayreuth , 2023 . - 14 p.
DOI: https://doi.org/10.15495/EPub_UBT_00007255

This is the latest version of this item.

Official URL: Volltext

Abstract in another language

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.

Further data

Item Type: Preprint, postprint
Keywords: network coding; capacity; adversarial network; single-error correction codes
Subject classification: Mathematics Subject Classification Code: 94B65
Institutions of the University: Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematical Economics
Faculties
Faculties > Faculty of Mathematics, Physics und Computer Science
Result of work at the UBT: Yes
DDC Subjects: 000 Computer Science, information, general works > 004 Computer science
500 Science > 510 Mathematics
Date Deposited: 24 Oct 2023 06:10
Last Modified: 24 Oct 2023 06:10
URI: https://eref.uni-bayreuth.de/id/eprint/87378

Available Versions of this Item