Sascha Kurz

activity

20142026

most citedTrifferent codes with small lengths

6 citations · 6 across the 14 of their papers we have counts for

collaborators

Showing 2023Show all

4 papers · 1 filter

math.CO2023

Bounds on the minimum distance of locally recoverable codes

Sascha Kurz

We consider locally recoverable codes (LRCs) and aim to determine the smallest possible length $n = n_{q} (k, d, r)$ of a linear $[n, k, d]_{q}$ -code with locality $r$ . For $k \leq 7$ we exactl…

math.CO2023

Divisible minimal codes

Vladimir Chubenko, Sascha Kurz

Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible leng…

math.CO2023

Lengths of divisible codes -- the missing cases

Sascha Kurz

A linear code $C$ over $F_{q}$ is called $Δ$ -divisible if the Hamming weights $wt (c)$ of all codewords $c \in C$ are divisible by $Δ$ . The possible effective…

math.CO2023★ 6 cited

Trifferent codes with small lengths

Sascha Kurz

A code $C \subseteq {0, 1, 2}^{n}$ of length $n$ is called trifferent if for any three distinct elements of $C$ there exists a coordinate in which they all differ. By $T (n)$ we den…