20 citations · 43 across the 6 of their papers we have counts for
10 papers · 1 filter
Algorithms and Complexity for Counting Configurations in Steiner Triple Systems
Daniel Heinlein, Patric R. J. Östergård
Steiner triple systems form one of the most studied classes of combinatorial designs. Configurations, including subsystems, play a central role in the investigation of Steiner trip…
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…
Generalized linkage construction for constant-dimension codes
Daniel Heinlein
A constant-dimension code (CDC) is a set of subspaces of constant dimension in a common vector space with upper bounded pairwise intersection. We improve and generalize two constru…
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…