The following pages link to Daniel Heinlein (Q1620977):
Displaying 13 items.
- Binary subspace codes in small ambient spaces (Q1620978) (← links)
- Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound (Q1705522) (← links)
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 (Q1727355) (← links)
- New and updated semidefinite programming bounds for subspace codes (Q2210639) (← links)
- A subspace code of size 333 in the setting of a binary \(q\)-analog of the Fano plane (Q2311610) (← links)
- Coset Construction for Subspace Codes (Q4566591) (← links)
- Generalized Linkage Construction for Constant-Dimension Codes (Q4963922) (← links)
- New LMRD Code Bounds for Constant Dimension Codes and Improved Constructions (Q5224114) (← links)
- Generalized vector space partitions (Q5377019) (← links)
- Enumerating Steiner triple systems (Q6064438) (← links)
- Algorithms and complexity for counting configurations in Steiner triple systems (Q6146212) (← links)
- Steiner triple systems of order 21 with subsystems (Q6146847) (← links)
- Constructing random Steiner triple systems: an experimental study (Q6613365) (← links)
