New and updated semidefinite programming bounds for subspace codes

Daniel Heinlein*, Ferdinand Ihringer

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review


We show that A2 (7, 4) ≤ 388 and, more generally, Aq(7, 4) ≤ (q2 − q + 1)[7] + q4 − 2q3 + 3q2 − 4q + 4 by semidefinite programming for q ≤ 101. Furthermore, we extend results by Bachoc et al. on SDP bounds for A2 (n, d), where d is odd and n is small, to Aq(n, d) for small q and small n.

Original languageEnglish
Pages (from-to)613-630
Number of pages18
JournalAdvances in Mathematics of Communications
Issue number4
Early online dateNov 2019
Publication statusPublished - Nov 2020
MoE publication typeA1 Journal article-refereed


  • Coherent configuration
  • Finite projective space
  • Network coding
  • Semidefinite programming
  • Subspace code
  • Subspace distance


Dive into the research topics of 'New and updated semidefinite programming bounds for subspace codes'. Together they form a unique fingerprint.

Cite this