activity
20072024
most citedOptimal Binary Subspace Codes of Length 6, Constant Dimension 3 and Minimum Distance 4

56 citations · 229 across the 26 of their papers we have counts for

collaborators

27 papers

math.CO2024★ 1 cited

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…

math.CO2019★ 1 cited

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…

math.CO2018★ 6 cited

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…

math.CO2018★ 1 cited

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…

math.CO2018★ 1 cited

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…

math.RA2017★ 5 cited

The Extension Theorem for Bi-invariant Weights over Frobenius Rings and Frobenius Bimodules

Oliver W. Gnilke, Marcus Greferath, Thomas Honold +2

We give a sufficient condition for a bi-invariant weight on a Frobenius bimodule to satisfy the extension property. This condition applies to bi-invariant weights on a finite Frobe…