New constant dimension subspace codes from multilevel linkage construction
The problem of finding large constant dimension subspace codes (CDCs) is an active area of research. One major technique is to construct these codes by lifting rank-metric codes. One class of rank-metric codes that has been used in this way are the Ferrers diagram rank-metric codes. Etzion and Silberstein have described a multilevel construction for CDCs based on these codes [\textit{T. Etzion} and \textit{N. Silberstein}, IEEE Trans. Inf. Theory 55, No. 7, 2909--2919 (2009; Zbl 1367.94414)]. These ideas are further developed by \textit{N. Silberstein} and \textit{A.-L. Trautmann} [IEEE Trans. Inf. Theory 61, No. 7, 3937--3953 (2015; Zbl 1359.94834)].\N\NThe authors of this article introduce a variation of these codes that they call rank-restricted Ferrers diagram rank-metric (RFDRM) codes and describe a way to construct them. They present what they call a multilevel linkage construction for CDCs that combines ideas from the construction of Etzion and Silberstein with a construction from a recent paper of \textit{A. Cossidente} et al. [Adv. Math. Commun. 17, No. 3, 536--550 (2023; Zbl 1525.94067)]. The authors explain how using lifted RFDRM codes in this construction leads to new CDCs that have sizes improving on the best-known bounds in many cases.
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- New constant dimension subspace codes from improved parallel subcode construction
- Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
- New constant dimension subspace codes from block inserting constructions
- Construction of constant dimension codes via improved inserting construction
- A Rank-Metric Approach to Error Control in Random Network Coding
- Algebraic codes for network coding
- Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
- Bilinear forms over a finite field, with applications to coding theory
- Coding for Errors and Erasures in Random Network Coding
- Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction
- Construction of subspace codes through linkage
- Error-Correcting Codes in Projective Space
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Generalized Linkage 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 Constant-Dimension Subspace Codes from Maximum Rank Distance Codes
- New Constructions of Subspace Codes Using Subsets of MRD Codes in Several Blocks
- Optimal Ferrers Diagram Rank-Metric Codes
- Parallel Multilevel Constructions for Constant Dimension Codes
- Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
- Subspace codes from Ferrers diagrams
- Theory of codes with maximum rank distance
- Optimal Ferrers diagram rank-metric codes from MRD codes
- Generalized bilateral multilevel construction for constant dimension codes from parallel mixed dimension construction
- New constructions of cyclic constant-dimension subspace codes based on Sidon spaces and subspace polynomials
- Generalized bilateral multilevel construction for constant dimension 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: New constant dimension subspace codes from multilevel linkage construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584303)
