Showing cs.ITShow all
3 papers · 1 filter
cs.IT2026
Capacity of Non-Separable Networks with Restricted Adversaries
Christopher Hojny, Altan B. Kılıç, Sascha Kurz +1
This paper investigates the problem of single-source multicasting over a communication network in the presence of restricted adversaries. When the adversary is constrained to opera…
cs.IT2025
Linear codes for -symbol read channels attaining the Griesmer bound
Sascha Kurz
Reading channels where -tuples of adjacent symbols are read at every step have e.g.\ applications in storage. Corresponding bounds and constructions of codes for the -symbol…
cs.IT2024
Additive codes attaining the Griesmer bound
Sascha Kurz
Additive codes may have better parameters than linear codes. However, still very few cases are known and the explicit construction of such codes is a challenging problem. Here we s…