New constant dimension subspace codes from parallel linkage construction and multilevel construction
From MaRDI portal
Publication:2130037
DOI10.1007/s12095-021-00504-zzbMath1496.94085OpenAlexW3173933443MaRDI QIDQ2130037
Qin Yue, Yongfeng Niu, Daitao Huang
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-00504-z
rank-metric codesFerrers diagramconstant dimension codesidentifying vectorparallel linkage construction
Related Items (7)
Constant dimension codes from multilevel construction based on matchings of complete hypergraphs ⋮ Construction of constant dimension codes via improved inserting construction ⋮ Generalized block inserting for constructing new constant dimension codes ⋮ Bilateral multilevel construction of constant dimension codes ⋮ New constructions of constant dimension codes by improved inserting construction ⋮ Improved generalized block inserting construction of constant dimension codes ⋮ An asymptotically optimal construction of almost affinely disjoint subspaces
Cites Work
- Construction of subspace codes through linkage
- Johnson type bounds on constant dimension codes
- 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
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- Constructions of cyclic constant dimension codes
- Constructions of optimal Ferrers diagram rank metric codes
- Several classes of optimal Ferrers diagram rank-metric codes
- Several kinds of large cyclic subspace codes via Sidon spaces
- Cyclic subspace codes via subspace polynomials
- A characterization of cyclic subspace codes via subspace polynomials
- Optimal Ferrers Diagram Rank-Metric Codes
- Subspace Polynomials and Cyclic Subspace Codes
- Codes and Designs Related to Lifted MRD Codes
- Coding for Errors and Erasures in Random Network Coding
- Coset Construction for Subspace Codes
- New Constant-Dimension Subspace Codes from Maximum Rank Distance 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
- Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations
- Constructions for Optimal Ferrers Diagram Rank-Metric Codes
- Error-Correcting Codes in Projective Space
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
This page was built for publication: New constant dimension subspace codes from parallel linkage construction and multilevel construction
