9 papers
Generalized Hamming weights of additive codes and geometric counterparts
Jozefien D'haeseleer, Sascha Kurz
We consider the geometric problem of determining the maximum number of -spaces in the projective space such that each subspace of c…
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…
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…
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…
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…