New Constructions of Subspace Codes Using Subsets of MRD Codes in Several Blocks

A basic problem for the constant dimension subspace coding is to determine the maximal possible size A _q (n, d, k) of a set of k-dimensional subspaces in F ⁿ _q such that the subspace distance satisfies d(U, V ) = 2k - 2 dim (U ∩ V ) ≥ d for any two different subspaces U and V in this set. We present two new constructions of constant dimension subspace codes using subsets of maximum rank-distance (MRD) codes in several blocks. This method is firstly applied to the linkage construction and secondly to arbitrary number of blocks of lifting MRD codes. In these two constructions, subsets of MRD codes with bounded ranks play an essential role. The Delsarte theorem about the rank distribution of MRD codes is an important ingredient to count codewords in our constructed constant dimension subspace codes. We give many new lower bounds for A _q (n, d, k). More than 110 new constant dimension subspace codes better than previously best known codes are constructed.