Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction

DOI10.1109/TIT.2019.2960343zbMath1448.94299OpenAlexW2996286318MaRDI QIDQ5123893

Fagang Li

Publication date: 29 September 2020

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

Full work available at URL: https://doi.org/10.1109/tit.2019.2960343

zbMATH Keywords

lower boundsmaximum possible cardinalityconstant-dimension codes (CDCs)

Mathematics Subject Classification ID

Other types of codes (94B60)

Related Items (11)

New constant dimension subspace codes from block inserting constructions ⋮ New constant dimension subspace codes from parallel linkage construction and multilevel construction ⋮ Construction of constant dimension codes via improved inserting construction ⋮ 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 ⋮ 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: Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction