2k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR75 papers
- University of MünsterDE37 papers
- Los Alamos National LaboratoryUS33 papers
- Max Planck Institute for Dynamics and Self-OrganizationDE26 papers
- Observatoire de la Côte d’AzurFR26 papers
- University of StuttgartDE25 papers
- Friedrich-Alexander-Universität Erlangen-NürnbergDE23 papers
- Heinrich Heine University DüsseldorfDE23 papers
- Northwestern UniversityUS23 papers
- Deutsches Elektronen-Synchrotron DESYDE22 papers
- Bogolyubov Institute for Theoretical PhysicsUA21 papers
- ETH ZurichCH21 papers
68 papers · 1 filter
Some new Steiner designs
Michael Kiermaier, Vedran Krčadinac, Vladimir D. Tonchev +2
The Kramer-Mesner method for constructing designs with a prescribed automorphism group has proven effective many times. In the special case of Steiner designs, the task reduces…
The degree of functions in the Johnson and q-Johnson schemes
Michael Kiermaier, Jonathan Mannaert, Alfred Wassermann
In 1982, Cameron and Liebler investigated certain "special sets of lines" in PG(3,q), and gave several equivalent characterizations. Due to their interesting geometric and algebrai…
Designs in finite classical polar spaces
Michael Kiermaier, Kai-Uwe Schmidt, Alfred Wassermann
Combinatorial designs have been studied for nearly 200 years. Fifty years ago, Cameron, Delsarte, and Ray-Chaudhury started investigating their q-analogs, also known as subspace de…
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…
Higher incidence matrices and tactical decomposition matrices
Michael Kiermaier, Alfred Wassermann
In 1985, Janko and Tran Van Trung published an algorithm for constructing symmetric designs with prescribed automorphisms. This algorithm is based on the equations by Dembowski (19…
Irreducible subcube partitions
Yuval Filmus, Edward Hirsch, Sascha Kurz +4
A \emph{subcube partition} is a partition of the Boolean cube into subcubes. A subcube partition is irreducible if the only sub-partitions whose union is a subcube are…
The Geometry of -arcs
Sascha Kurz, Ivan Landjev, Francesco Pavese +1
In this paper, we give a geometric construction of the three strong non-lifted -arcs in of respective sizes 128, 143, and 168, and construct an…
Affine vector space partitions
John Bamberg, Yuval Filmus, Ferdinand Ihringer +1
An affine vector space partition of is a set of proper affine subspaces that partitions the set of points. Here we determine minimum sizes and enumerate eq…
Classification of arcs in
Sascha Kurz, Ivan Landjev, Assia Rousseva
The proof of the non-existence of Griesmer -codes is just one of many examples where extendability results are used. In a series of papers Landjev and Rousseva have…
On -points of -analogs of the Fano plane
Michael Kiermaier
Arguably, the most important open problem in the theory of -analogs of designs is the question for the existence of a -analog of the Fano plane. It is undecided for every…
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…
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…
Bounds for flag codes
Sascha Kurz
The application of flags to network coding has been introduced recently by Liebhold, Nebe, and Vazquez-Castro. It is a variant to random linear network coding and explicit routing…
On the minimum number of minimal codewords
Romar dela Cruz, Michael Kiermaier, Sascha Kurz +1
We study the minimum number of minimal codewords in linear codes from the point of view of projective geometry. We derive bounds and in some cases determine the exact values. We al…
Three-weight codes over rings and strongly walk regular graphs
Michael Kiermaier, Sascha Kurz, Minjia Shi +1
We construct strongly walk-regular graphs as coset graphs of the duals of codes with three non-zero homogeneous weights over for a prime, and more generally…
Combining subspace codes
Antonio Cossidente, Sascha Kurz, Giuseppe Marino +1
In the context of constant--dimension subspace codes, an important problem is to determine the largest possible size of codes whose codewords are -subspaces of $\…
Subspace Packings -- Constructions and Bounds
Tuvi Etzion, Sascha Kurz, Kamil Otal +1
The Grassmannian is the set of all -dimensional subspaces of the vector space . Kötter and Kschischang showed that codes in Grassmannian spa…
Subspaces intersecting in at most a point
Sascha Kurz
We improve on the lower bound of the maximum number of planes in $\operatorname{PG}(8,q)\cong\F_q^{9}$ pairwise intersecting in at most a point. In terms of constant dimension code…
The lengths of projective triply-even binary codes
Thomas Honold, Michael Kiermaier, Sascha Kurz +1
It is shown that there does not exist a binary projective triply-even code of length . This settles the last open length for projective triply-even binary codes. Therefore, pro…
Johnson type bounds for mixed dimension subspace codes
Thomas Honold, Michael Kiermaier, Sascha Kurz
Subspace codes, i.e., sets of subspaces of , are applied in random linear network coding. Here we give improved upper bounds for their cardinalities based on the Jo…
Binary Subspace Codes in Small Ambient Spaces
Daniel Heinlein, Sascha Kurz
Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. Here we collect the present knowledge on…
Generalized vector space partitions
Daniel Heinlein, Thomas Honold, Michael Kiermaier +1
A vector space partition in is a set of subspaces such that every -dimensional subspace of is contained in exactly one element of…
Weighted Committee Games
Sascha Kurz, Alexander Mayer, Stefan Napel
Many binary collective choice situations can be described as weighted simple voting games. We introduce weighted committee games to model decisions on an arbitrary number of altern…