56 citations · 229 across the 26 of their papers we have counts for
18 papers · 1 filter
New Results on Arcs in Projective Hjelmslev Planes over Small Chain Rings
Thomas Honold, Michael Kiermaier, Ivan Landjev
We present various new constructions and bounds for arcs in projective Hjelmslev planes over finite chain rings of nilpotency index 2. For the chain rings of cardinality at most 25…
On projective -divisible codes
Daniel Heinlein, Thomas Honold, Michael Kiermaier +2
A projective linear code over is called -divisible if all weights of its codewords are divisible by . Especially, -divisible projective linear codes, wher…
The lengths of projective triply-even binary codes
Thomas Honold, Michael Kiermaier, Sascha Kurz +1
It is shown that there does not exist a binary projective triply-even code of length . This settles the last open length for projective triply-even binary codes. Therefore, pro…
Johnson type bounds for mixed dimension subspace codes
Thomas Honold, Michael Kiermaier, Sascha Kurz
Subspace codes, i.e., sets of subspaces of , are applied in random linear network coding. Here we give improved upper bounds for their cardinalities based on the Jo…
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…
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…