activity
20052023
most citedConstruction of Large Constant Dimension Codes With a Prescribed Minimum Distance

70 citations · 1.1k across the 129 of their papers we have counts for

collaborators
Showing 2016Show all

11 papers · 1 filter

math.CO2016★ 43 cited

Partial spreads and vector space partitions

Thomas Honold, Michael Kiermaier, Sascha Kurz

Constant-dimension codes with the maximum possible minimum distance have been studied under the name of partial spreads in Finite Geometry for several decades. Not surprisingly, fo…

cs.GT2016★ 3 cited

Fair Representation and a Linear Shapley Rule

Sascha Kurz, Nicola Maaser, Stefan Napel

When delegations to an assembly or council represent differently sized constituencies, they are often allocated voting weights which increase in population numbers (EU Council, US…

math.CO2016★ 3 cited

Upper bounds for partial spreads

Sascha Kurz

A partial -spread in is a collection of -dimensional subspaces with trivial intersection such that each non-zero vector is covered at most once. We present s…

math.CO2016★ 10 cited

Classification of large partial plane spreads in and related combinatorial objects

Thomas Honold, Michael Kiermaier, Sascha Kurz

In this article, the partial plane spreads in of maximum possible size and of size are classified. Based on this result, we obtain the classification of the fol…

math.CO2016★ 24 cited

The order of the automorphism group of a binary -analog of the Fano plane is at most two

Michael Kiermaier, Sascha Kurz, Alfred Wassermann

It is shown that the automorphism group of a binary -analog of the Fano plane is either trivial or of order .

cs.GT2016★ 3 cited

Computing the Power Distribution in the IMF

Sascha Kurz

The International Monetary Fund is one of the largest international organizations using a weighted voting system. The weights of its 188 members are determined by a fixed amount of…