Construction of Const Dimension Code from Two Parallel Versions of Linkage Construction

Abstract

The linkage construction and its generalization is one of the most powerful constructions for constant dimension code, 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 \cite{combining2019Antonio} in the cases $A_q(13,4,4),A_q(17,4,4),A_q(19,6,6)$.

References in corpus (7)

• A Rank-Metric Approach to Error Control in Random Network Coding
• Tables of subspace codes
• Optimal Binary Subspace Codes of Length 6, Constant Dimension 3 and Minimum Distance 4
• Coset Construction for Subspace Codes
• Problems on q-Analogs in Coding Theory
• A note on the linkage construction for constant dimension codes
• Lifted codes and the multilevel construction for constant dimension codes