New constant dimension subspace codes from multilevel linkage construction
Huimin Lao, Hao Chen · Advances in Mathematics of Communications · 2022
One of the main problems in subspace coding is to determine the maximal possible size of a constant dimension subspace code with given parameters. In this paper, we introduce a family of new codes, named rank-restricted Ferrers diagram rank-metric codes, to give an improved construction of constant dimension subspace codes. Our method constructs many new CDCs with larger sizes than previously best-known codes.