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 2013Show all

6 papers · 1 filter

cs.GT2013

Measuring voting power in convex policy spaces

Sascha Kurz

Classical power index analysis considers the individual's ability to influence the aggregated group decision by changing its own vote, where all decisions and votes are assumed to…

math.CO2013

Constructing -clusters

Sascha Kurz, Landon Curt Noll, Randall Rathbun +1

A set of -lattice points in the plane, no three on a line and no four on a circle, such that all pairwise distances and all coordinates are integral is called an -cluster (in…

cs.GT2013★ 6 cited

The Prediction value

Maurice Koster, Sascha Kurz, Ines Lindner +1

We introduce the prediction value (PV) as a measure of players' informational importance in probabilistic TU games. The latter combine a standard TU game and a probability distribu…

math.CO2013★ 56 cited

Optimal Binary Subspace Codes of Length 6, Constant Dimension 3 and Minimum Distance 4

Thomas Honold, Michael Kiermaier, Sascha Kurz

It is shown that the maximum size of a binary subspace code of packet length , minimum subspace distance , and constant dimension is ; in Finite Geometry term…

math.CO2013★ 10 cited

Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum

Josep Freixas, Sascha Kurz

This paper is a twofold contribution. First, it contributes to the problem of enumerating some classes of simple games and in particular provides the number of weighted games with…

math.OC2013★ 20 cited

The nucleolus of large majority games

Sascha Kurz, Stefan Napel, Andreas Nohn

Members of a shareholder meeting or legislative committee have greater or smaller voting power than meets the eye if the nucleolus of the induced majority game differs from the vot…