Constant dimension codes (CDCs), as special subspace codes, have attracted extensive attention due to their application at random network coding. In this paper, we present some variations on the insert construction method by changing the positions of some matrices. Those variations help us to construct more types of CDCs. By restricting the rank of matrices in rank metric codes, We can get that the union of these codes is still a CDC and the minimum subspace distance can be preserved. We generalize the previous results in He et al. (IEEE Commun Lett 25(5):1422–1426, 2021) and Lao et al. (arXiv:2008.09944v1, 2020) and obtain some new lower bounds of CDCs.

恒维码（CDCs）作为一种特殊的子空间码，因其在随机网络编码中的应用而受到广泛关注。在本文中，我们通过改变一些矩阵的位置来展示插入构造方法的一些变化。这些变化有助于我们构建更多类型的 CDC。通过对秩度量代码中矩阵的秩进行限制，我们可以得到这些代码的并集仍然是一个CDC，并且可以保留最小子空间距离。我们概括了 He 等人之前的结果。（IEEE Commun Lett 25(5):1422–1426, 2021）和Lao 等人。(arXiv:2008.09944v1, 2020) 并获得一些新的 CDC 下限。