6 citations · 6 across the 14 of their papers we have counts for
15 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 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…
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…
Computer classification of linear codes based on lattice point enumeration and integer linear programming
Sascha Kurz
Linear codes play a central role in coding theory and have applications in several branches of mathematics. For error correction purposes the minimum Hamming distance should be as…
Non-projective two-weight codes
Sascha Kurz
It has been known since the 1970's that the difference of the non-zero weights of a projective -linear two-weight has to be a power of the characteristic of the under…
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 of a linear -code with locality . For we exactl…
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…
Lengths of divisible codes -- the missing cases
Sascha Kurz
A linear code over is called -divisible if the Hamming weights of all codewords are divisible by . The possible effective…
Trifferent codes with small lengths
Sascha Kurz
A code of length is called trifferent if for any three distinct elements of there exists a coordinate in which they all differ. By we den…
Varieties of Nodal surfaces, coding theory and Discriminants of cubic hypersurfaces. Part 1: Generalities and nodal K3 surfaces. Part 2: Cubic Hypersurfaces, associated discriminants. Part 3: Nodal quintics. Part 4: Nodal sextics
Fabrizio Catanese, in collaboration with Yonghwa Cho, Stephen Coughlan +4
We attach two binary codes to a projective nodal surface (the strict code K and, for even degree d, the extended code K' ) to investigate the `Nodal Severi varieties F(d, n) of nod…
An exact column-generation approach for the lot-type design problem -- extended abstract
Miriam Kießling, Sascha Kurz, Jörg Rambau
We consider a fashion discounter that supplies any of its many branches with an integral multiple of lots whose size assortment structure stems from a set of many applicable lot-ty…