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

7 papers · 1 filter

cs.DM2015★ 5 cited

The Maximum Scatter TSP on a Regular Grid

Isabella Hoffmann, Sascha Kurz, Jörg Rambau

In the maximum scatter traveling salesman problem the objective is to find a tour that maximizes the shortest distance between any two consecutive nodes. This model can be applied…

econ.GN2015★ 12 cited

Key drivers of EU budget allocation: Does power matter?

Vera Zaporozhets, María García-Valiñas, Sascha Kurz

We examine the determinants of the EU budget expenditures allocation among different countries. In line with earlier literature, we consider two alternative explanations for the EU…

math.CO2015★ 50 cited

Coset Construction for Subspace Codes

Daniel Heinlein, Sascha Kurz

One of the main problems of the research area of network coding is to compute good lower and upper bounds of the achievable cardinality of so-called subspace codes in $\operatornam…

math.CO2015★ 2 cited

Constructions and Bounds for Mixed-Dimension Subspace Codes

Thomas Honold, Michael Kiermaier, Sascha Kurz

Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. The resulting so-called \emph{Main Probl…

math.CO2015★ 24 cited

Improved upper bounds for partial spreads

Sascha Kurz

A partial -spread in is a collection of -dimensional subspaces with trivial intersection, i.e., each point is covered at most once. So far…

cs.GT2015★ 3 cited

Representation-Compatible Power Indices

Serguei Kaniovski, Sascha Kurz

This paper studies power indices based on average representations of a weighted game. If restricted to account for the lack of power of dummy voters, average representations become…