New constant dimension subspace codes from block inserting constructions
From MaRDI portal
Publication:2130029
DOI10.1007/s12095-021-00524-9zbMath1495.94110OpenAlexW3195881199MaRDI QIDQ2130029
Hao Chen, Huimin Lao, Xiaoqing Tan
Publication date: 25 April 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-021-00524-9
Related Items (3)
Construction of constant dimension codes via improved inserting construction ⋮ Generalized block inserting for constructing new constant dimension codes ⋮ Improved generalized block inserting construction of constant dimension codes
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
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
- Codes and Designs Related to Lifted MRD Codes
- Coding for Errors and Erasures in Random Network Coding
- Coset Construction for Subspace Codes
- Linear authentication codes: bounds and constructions
- 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
- Error-Correcting Codes in Projective Space
This page was built for publication: New constant dimension subspace codes from block inserting constructions
