Generalized Linkage Construction for Constant-Dimension Codes

DOI10.1109/TIT.2020.3038272zbMath1465.94107arXiv1910.11195OpenAlexW3098910696MaRDI QIDQ4963922

Daniel Heinlein

Publication date: 24 February 2021

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.11195

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Related Items (13)

New constant dimension subspace codes from block inserting constructions ⋮ Constant dimension codes from multilevel construction based on matchings of complete hypergraphs ⋮ Optimal Ferrers diagram rank-metric codes from MRD codes ⋮ Generalized block inserting for constructing new constant dimension codes ⋮ Bilateral multilevel construction of constant dimension codes ⋮ The interplay of different metrics for the construction of constant dimension codes ⋮ Combining subspace codes ⋮ Constructions of optimum distance full flag codes ⋮ New constructions of constant dimension codes by improved inserting construction ⋮ Improved generalized block inserting construction of constant dimension codes ⋮ An asymptotically optimal construction of almost affinely disjoint subspaces ⋮ Parallel sub-code construction for constant-dimension codes ⋮ Enhancing Echelon-Ferrers construction for constant dimension code

This page was built for publication: Generalized Linkage Construction for Constant-Dimension Codes