60 citations · 171 across the 20 of their papers we have counts for
4 papers · 1 filter
New and Updated Semidefinite Programming Bounds for Subspace Codes
Daniel Heinlein, Ferdinand Ihringer
We show that and, more generally, by semidefinite programming for . Furthermore, we exte…
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…
New LMRD bounds for constant dimension codes and improved constructions
Daniel Heinlein
We generalize upper bounds for constant dimension codes containing a lifted maximum rank distance code first studied by Etzion and Silberstein. The proof allows to construct severa…