20 citations · 42 across the 4 of their papers we have counts for
4 papers
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…
Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
Daniel Heinlein, Sascha Kurz
We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network codi…
A new upper bound for subspace codes
Daniel Heinlein, Sascha Kurz
It is shown that the maximum size of a binary subspace code of packet length , minimum subspace distance , and constant dimension is at most . In…
Projective divisible binary codes
Daniel Heinlein, Thomas Honold, Michael Kiermaier +2
For which positive integers does there exist a linear code over with all codeword weights divisible by and such that the columns of a gener…