New constant dimension subspace codes from multilevel linkage construction
From MaRDI portal
Publication:6584303
DOI10.3934/amc.2022039MaRDI QIDQ6584303
Publication date: 6 August 2024
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
finite projective geometrysubspace codesmultilevel constructionconstant dimension subspace (CDS) codesFerrers diagram rank-metric codes
Bounds on codes (94B65) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20)
Cites Work
- Construction of subspace codes through linkage
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
- New constant dimension subspace codes from block inserting constructions
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- Algebraic codes for network coding
- Optimal Ferrers Diagram Rank-Metric Codes
- Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes
- Generalized Linkage Construction for Constant-Dimension Codes
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction
- New Constructions of Subspace Codes Using Subsets of MRD Codes in Several Blocks
- Parallel Multilevel Constructions for Constant Dimension Codes
- Subspace codes from Ferrers diagrams
- Error-Correcting Codes in Projective Space
This page was built for publication: New constant dimension subspace codes from multilevel linkage construction
