The linkage construction and its generalization is one of the most powerful constructions for constant dimension codes, accounting for approximately 50% of all the listed parameters. We show how to improve the linkage construction of subspace codes by two parallel versions of the linkage construction. This proof allows us to attain codes of larger size for a given minimum distance, which exceeds the latest improvements on the linkage construction in the cases $A_{q}(13,4,4),A_{q}(17,4,4)$ , and $A_{q}(19,6,6)$ .

中文翻译：

---

从两个平行版本的连杆构造构造恒维码

链接构造及其泛化是恒维代码最强大的构造之一，约占所有列出参数的 50%。我们展示了如何通过链接构建的两个并行版本来改进子空间代码的链接构建。这个证明使我们能够在给定的最小距离内获得更大尺寸的代码，这超过了案例中链接结构的最新改进 $A_{q}(13,4,4),A_{q}(17,4,4)$ ， 和 $A_{q}(19,6,6)$ .