A new upper bound for subspace codes

Abstract

It is shown that the maximum size $A_2(8,6;4)$ of a binary subspace code of packet length $v=8$, minimum subspace distance $d=4$, and constant dimension $k=4$ is at most $272$. In Finite Geometry terms, the maximum number of solids in $\mathrm{PG}(7,2)$, mutually intersecting in at most a point, is at most $272$. Previously, the best known upper bound $A_2(8,6;4)\le 289$ was implied by the Johnson bound and the maximum size $A_2(7,6;3)=17$ of partial plane spreads in $\mathrm{PG}(6,2)$. The result was obtained by combining the classification of subspace codes with parameters $(7,17,6;3{)}_2$ and $(7,34,5;\{3,4\}{)}_2$ with integer linear programming techniques. The classification of $(7,33,5;\{3,4\}{)}_2$ subspace codes is obtained as a byproduct.

9 pages