Randomized trial investigates methods to enhance constant dimension subspace codes, suggesting improved upper limits.
The construction of (n, d, k)q constant dimension subspace codes (CDCs) of the maximum possible size over 𝔽q is a basic problem in subspace coding. The echelon-Ferrers construction is one of the most adaptable and efficient methods for creating large CDCs across a wide range of parameters n, d, k, and q. This study presents a combination of the linkage and echelon–Ferrers constructions, utilizing suitable identifying vectors to generate 35 new CDCs with relatively larger sizes for d = 4 and k = 3. Consequently, new and improved lower bounds for several Aq(n, d, k) are established, exceeding prior best-known results.
No takes yet. Share an insight, caveat, or question.
Kumar et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: