Parallel sub-code construction for constant-dimension codes
From MaRDI portal
Publication:2099164
DOI10.1007/S10623-022-01065-9OpenAlexW4282933627WikidataQ114849710 ScholiaQ114849710MaRDI QIDQ2099164
Yindong Chen, Zusheng Zhang, Xianmang He, Kunxiao Zhou
Publication date: 23 November 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01065-9
Related Items (2)
Constant dimension codes from multilevel construction based on matchings of complete hypergraphs ⋮ New constructions of constant dimension codes by improved inserting construction
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
- Subspace codes in \(\operatorname{PG}(2N-1; q)\)
- 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
- Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
- Coding for Errors and Erasures 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
- Combining subspace codes
This page was built for publication: Parallel sub-code construction for constant-dimension codes
