Login
Publications by the same author
plus in the repository
plus in Google Scholar
Bibliografische Daten exportieren		  

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

DOI zum Zitieren der Version auf EPub Bayreuth: https://doi.org/10.15495/EPub_UBT_00007255
URN to cite this document: urn:nbn:de:bvb:703-epub-7255-3

Title data

Kurz, Sascha:
Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes.
Bayreuth , 2023 . - 14 S.

This is the latest version of this item.

[thumbnail of Irsee6-Diamond_arxiv.pdf]
Format: PDF
Name: Irsee6-Diamond_arxiv.pdf
Version: Published Version
Available under License Creative Commons BY 4.0: Attribution
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.

Further data

Item Type: Preprint, postprint
Keywords: network coding; capacity; adversarial network; single-error correction codes
Subject classification: Mathematics Subject Classification Code: 94B65
DDC Subjects: 000 Computer Science, information, general works > 004 Computer science
500 Science > 510 Mathematics
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
Language: English
Originates at UBT: Yes
URN: urn:nbn:de:bvb:703-epub-7255-3
Date Deposited: 24 Oct 2023 06:02
Last Modified: 24 Oct 2023 06:08
URI: https://epub.uni-bayreuth.de/id/eprint/7255

Available Versions of this Item

Download Statistics

Downloads

Downloads per month over past year