On subspace codes (Q5963370)

An \(n\)-dimensional vector space over the field \(F\) with \(q\) elements gives rise to an \((n-1)\)-dimensional projective space. The set of subspaces \(S\) of either space becomes a metric space by the subspace distance: \(d(U,U'):=\dim(U+U')-\dim(U\cap U')\), \(U,U'\in S\). These metric spaces are canonically isomorphic. The authors construct a \(q\)-ary constant-dimension (\(k=3\)) code \(C\) inside \(S\), with parameters \(n=6\), minimum distance \(d=4\) and size \(M=q^6+2q^{2}+2q+1\). In geometric language, \(C\) consist of planes which mutually intersect in at most one point inside the projective space of dimension \(5\) over \(F\). The code is constructed using projective bundles of the projective plane over \(F\). In [\textit{T. Honold} et al., Contemp. Math. 632, 157--176 (2015; Zbl 1355.94094)], it is shown for \(q=2\) that \(M=77=2^{6}+2\cdot 2^{2}+2\cdot2+1\) is the maximum possible size for \(C\) as above. In this paper, all such \((6,77,4;3)\)-codes are classified and a special class which generalizes to all \(q\) is given. The authors speculate that this generalized code might coincide with their own construction.