Parallel construction for constant dimension codes from mixed dimension construction
From MaRDI portal
Cites work
- Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
- Bilateral multilevel construction of constant dimension codes
- Bilinear forms over a finite field, with applications to coding theory
- Codes and Designs Related to Lifted MRD Codes
- Coding for Errors and Erasures in Random Network Coding
- Combining subspace codes
- Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction
- Construction of subspace codes through linkage
- Double Multilevel Constructions for Constant Dimension Codes
- Error-Correcting Codes in Projective Space
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Generalized Linkage Construction for Constant-Dimension Codes
- Linear authentication codes: bounds and constructions
- Linear network coding
- New constant dimension subspace codes from block inserting constructions
- New constant dimension subspace codes from the mixed dimension construction
- New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes
- New Constructions of Subspace Codes Using Subsets of MRD Codes in Several Blocks
- Parallel Multilevel Constructions for Constant Dimension Codes
- Parallel sub-code construction for constant-dimension codes
- Recursive Code Construction for Random Networks
- Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
- Theory of codes with maximum rank distance
Cited in
(1)
This page was built for publication: Parallel construction for constant dimension codes from mixed dimension construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030652)
