60 citations · 171 across the 20 of their papers we have counts for
5 papers · 1 filter
Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
Daniel Heinlein, Thomas Honold, Michael Kiermaier +2
The maximum size of a binary subspace code of packet length , minimum subspace distance , and constant dimension is , where the isomorphism ty…
A subspace code of size in the setting of a binary -analog of the Fano plane
Daniel Heinlein, Michael Kiermaier, Sascha Kurz +1
We show that there is a binary subspace code of constant dimension 3 in ambient dimension 7, having minimum distance 4 and cardinality 333, i.e., , which improv…
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…