output
19922026
most citedThe World of the Complex Ginzburg-Landau Equation

2k citations

Showing 2015 · math.COShow all

6 papers · 2 filters

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…

math.CO2015★ 22 cited

On putative q-Analogues of the Fano Plane and Related Combinatorial Structures

Thomas Honold, Michael Kiermaier

A set of -dimensional subspaces of , the -dimensional vector space over the finite field , is said to form a -analogue of the…

math.CO2015★ 3 cited

New complete 2-arcs in the uniform projective Hjelmslev planes over chain rings of order 25

Michael Kiermaier, Matthias Koch

In this paper a 2-arc of size 21 in the projective Hjelmslev plane PHG(2,\Z_25) and a 2-arc of size 22 in PHG(2,\F_5[X]/(X^2)) are given. Both arcs are bigger than the 2-arcs previ…

math.CO2015★ 23 cited

On the automorphism group of a binary -analog of the Fano plane

Michael Braun, Michael Kiermaier, Anamari Nakić

The smallest set of admissible parameters of a -analog of a Steiner system is . The existence of such a Steiner system -- known as a binary -analog of the Fano pl…