6 papers
Optimal codes and arcs for the generalized Hamming weights
Sascha Kurz, Ivan Landjev, Assia Rousseva
This text contains some notes on the Griesmer bound. In particular, we give a geometric proof of the Griesmer bound for the generalized weights and show that a Solomon--Stiffler ty…
Equivalent bounded confidence processes
Sascha Kurz
In the bounded confidence model the opinions of a set of agents evolve over discrete time steps. In each round an agent averages the opinion of all agents whose opinions are at mos…
Generalized ovals, 2.5-dimensional additive codes, and multispreads
Denis S. Krotov, Sascha Kurz
We present constructions and bounds for additive codes over a finite field in terms of their geometric counterpart, i.e., projective systems. It is known that the maximum number of…
Manhattan and Chebyshev flows
Lukáš Gáborik, Sascha Kurz, Giuseppe Mazzuoccolo +2
We investigate multidimensional nowhere-zero flows of bridgeless graphs. By extending the established use of the Euclidean norm, this paper considers the Manhattan and Chebyshev no…
Nodal surfaces in and coding theory
Sascha Kurz
To each nodal hypersurface one can associate a binary linear code. Here we show that the binary linear code associated to sextics in with the maximum number of …
Simple games with minimum
Sascha Kurz, Dani Samaniego
Every simple game is a monotone Boolean function. For the other direction we just have to exclude the two constant functions. The enumeration of monotone Boolean functions with dis…