New Constant Dimension Subspace Codes From Generalized Inserting Construction
Yongfeng Niu, Qin Yue, Daitao Huang · IEEE Communications Letters · 2020
A basic problem about a constant dimension subspace code is to find its maximal possible size Aq(n, d, k). Linkage construction and inserting construction are two effective methods to improve lower bounds for constant dimension codes. This letter concentrates on parallel linkage construction by He and direct inserting construction by Lao and generalizes the previous results to obtain new lower bounds of constant dimension codes, such as Aq(12,4,6).