New constructions of constant dimension codes by improved inserting construction
From MaRDI portal
Publication:2698184
DOI10.1016/j.amc.2023.127885OpenAlexW4318937695MaRDI QIDQ2698184
You Gao, Min-Yao Niu, Jinghua Xiao
Publication date: 21 April 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2023.127885
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
- Weight distribution of rank-metric codes
- Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
- Subspace codes in \(\operatorname{PG}(2N-1; q)\)
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- Parallel sub-code construction for constant-dimension codes
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- Bounds for flag codes
- Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
- Codes and Designs Related to Lifted MRD Codes
- 13. MRD codes: constructions and connections
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Coset Construction for Subspace Codes
- 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
- Rank-metric codes
- 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
- Error-Correcting Codes in Projective Space
This page was built for publication: New constructions of constant dimension codes by improved inserting construction
