70 citations · 1.1k across the 129 of their papers we have counts for
17 papers · 1 filter
Classification of 8-divisible binary linear codes with minimum distance 24
Sascha Kurz
We classify 8-divisible binary linear codes with minimum distance 24 and small length. As an application we consider the codes associated to nodal sextics with 65 ordinary double p…
On strongly walk regular graphs, triple sum sets and their codes
Michael Kiermaier, Sascha Kurz, Patrick Solé +2
Strongly walk regular graphs (SWRGs or -SWRGs) form a natural generalization of strongly regular graphs (SRGs) where paths of length~2 are replaced by paths of length~. They…
Bounds for the multilevel construction
Tao Feng, Sascha Kurz, Shuangqing Liu
One of the main problems in random network coding is to compute good lower and upper bounds on the achievable cardinality of the so-called subspace codes in the projective space $\…
A generalization of the cylinder conjecture for divisible codes
Sascha Kurz, Sam Mattheus
We extend the original cylinder conjecture on point sets in affine three-dimensional space to the more general framework of divisible linear codes over and their cla…
Classification of -divisible linear codes spanned by codewords of weight
Michael Kiermaier, Sascha Kurz
We classify all -ary -divisible linear codes which are spanned by codewords of weight . The basic building blocks are the simplex codes, and for additionally the fir…
Efficient Storage Schemes for Desired Service Rate Regions
Fatemeh Kazemi, Sascha Kurz, Emina Soljanin +1
A major concern in cloud/edge storage systems is serving a large number of users simultaneously. The service rate region is introduced recently as an important performance metric f…