Sascha Kurz

collaborators

4 papers

cs.IT2026

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…

math.CO2026

Optimal additive quaternary codes of dimension $3.5$ and $4$

Sascha Kurz

After the optimal parameters of additive quaternary codes of dimension $k \leq 3$ have been determined there is some recent activity to settle the next case of dimension $k = 3.5$ . Her…

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 $b$ -symbol read channels attaining the Griesmer bound

Sascha Kurz

Reading channels where $b$ -tuples of adjacent symbols are read at every step have e.g.\ applications in storage. Corresponding bounds and constructions of codes for the $b$ -symbol…

Additive codes attaining the Griesmer bound

Optimal additive quaternary codes of dimension 3.5 and 4

Capacity of Non-Separable Networks with Restricted Adversaries

Linear codes for b-symbol read channels attaining the Griesmer bound

Optimal additive quaternary codes of dimension $3.5$ and $4$

Linear codes for $b$ -symbol read channels attaining the Griesmer bound