Parallel Multilevel Constructions for Constant Dimension Codes

DOI10.1109/TIT.2020.3004315MaRDI QIDQ5138864zbMATH OpenOpenAlexFDO

Authors Shuangqing Liu, Tao Feng, Yanxun Chang

Publication date 4 December 2020

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

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

zbMATH Keywords

constant dimension codes (CDC)Gabidulin codesingleton-like upper boundlower boundrank metric codes with given ranks (GRMC)

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Abstract: Constant dimension codes (CDCs), as special subspace codes, have received a lot of attention due to their application in random network coding. This paper introduces a family of new codes, called rank metric codes with given ranks (GRMCs), to generalize the parallel construction in [Xu and Chen, IEEE Trans. Inf. Theory, 64 (2018), 6315--6319] and the classic multilevel construction. A Singleton-like upper bound and a lower bound for GRMCs derived from Gabidulin codes are given. Via GRMCs, two effective constructions for CDCs are presented by combining the parallel construction and the multilevel construction. Many CDCs with larger size than the previously best known codes are given. The ratio between the new lower bound and the known upper bound for $(4delta,2delta,2delta{)}_q$-CDCs is calculated. It is greater than 0.99926 for any prime power $q$ and any $deltageq3$.

Cited in

(24)

• Parallel sub-code construction for constant-dimension codes
• New constant dimension subspace codes from block inserting constructions
• New constant dimension subspace codes from parallel linkage construction and multilevel construction
• New constructions of constant dimension codes by improved inserting construction
• Improved generalized block inserting construction of constant dimension codes
• Multilevel codes based on partitioning
• Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
• Construction of constant dimension codes via improved inserting construction
• 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
• New constant dimension subspace codes from multilevel linkage construction
• New constant dimension subspace codes from improved parallel subcode construction
• Generalized bilateral multilevel construction for constant dimension codes from parallel mixed dimension construction
• Multilevel inserting constructions for constant dimension subspace codes
• Construction of optimal flag codes by MRD codes
• Parallel construction for constant dimension codes from mixed dimension construction
• Generalized bilateral multilevel construction for constant dimension codes
• Two new constructions of almost MFRD codes
• New constant dimension subspace codes by multilevel and parallel linkage constructions
• Improved parallel linkage construction of constant dimension codes via mixed dimension method
• Multilevel constructions of constant dimension codes based on one-factorization of complete graphs

This page was built for publication: Parallel Multilevel Constructions for Constant Dimension Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138864)