Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
arXiv:1705.03835 · doi:10.1007/978-3-319-66278-7_15
Abstract
We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show relations between them. A slightly improved version of the so-called linkage construction is presented which is e.g. used to construct constant dimension codes with subspace distance , dimension of the codewords for all field sizes , and sufficiently large dimensions of the ambient space, that exceed the MRD bound, for codes containing a lifted MRD code, by Etzion and Silberstein.
30 pages, 3 tables