Construction of optimal constant-dimension subspace codes

A subspace code of length (Formula presented.) over the finite field (Formula presented.) is a collection of subspaces of the (Formula presented.) -dimensional vector space (Formula presented.). Subspace codes are applied to a number of areas such as noncoherent linear network coding and linear authentication. A challenge in the research of subspace codes is to construct large codes with prescribed code parameters, such that the codes have the maximum number of codewords, or the number of codewords is larger than that of previously known codes. In the literature, a general method was proposed for the construction of large constant-dimension subspace codes based on integer linear programming. In this work, making use of an optimization approach for finding the maximum independent set of a graph, a procedure is developed for constructing large subspace codes. The procedure, in some cases, outperforms the existing approach based on integer linear programming, and finds new subspace codes that have more codewords than existing codes.