New and Updated Semidefinite Programming Bounds for Subspace Codes

Abstract

We show that $A_2(7,4)\le 388$ and, more generally, $A_q(7,4)\le (q^2-q+1)[7{]}_q+q^4-2q^3+3q^2-4q+4$ by semidefinite programming for $q\le 101$. Furthermore, we extend results by Bachoc et al. on SDP bounds for $A_2(n,d)$, where $d$ is odd and $n$ is small, to $A_q(n,d)$ for small $q$ and small $n$.

References in corpus (10)

• Tables of subspace codes
• Intersection numbers for subspace designs
• The order of the automorphism group of a binary $q$-analog of the Fano plane is at most two
• On the automorphism group of a binary $q$-analog of the Fano plane
• On putative q-Analogues of the Fano Plane and Related Combinatorial Structures
• A New Approach to the Main Problem of Subspace Coding
• The Expurgation-Augmentation Method for Constructing Good Plane Subspace Codes
• A New Approach to Examine q-Steiner Systems
• On the Structure of the $q$-Fano Plane
• Johnson type bounds for mixed dimension subspace codes