Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction
Fagang Li · IEEE Transactions on Information Theory · 2019
The main problem of constant-dimension subspace coding is to construct constant-dimension codes (CDCs) with the maximum possible cardinality. Lifting Ferrers diagram codes is an effective way to construct CDCs. In addition, the discovery of linkage construction allows to construct many CDCs, i.e., lower bounds. In this paper, we combine the two methods of construction and obtain some new lower bounds of CDCs for small parameters.