Parameter-controlled inserting constructions of constant dimension subspace codes

Huimin Lao, Hao Chen, Jian Weng +1

A basic problem in constant dimension subspace coding is to determine the maximal possible size ${\mathbf{A}}_q(n,d,k)$ of a set of $k$-dimensional subspaces in ${\mathbf{F}}_q^n$ such that…