Enhancing Echelon-Ferrers construction for constant dimension code
From MaRDI portal
Publication:2103101
Recommendations
- Construction of constant dimension codes via improved inserting construction
- New constructions of constant dimension codes by improved inserting construction
- Improved generalized block inserting construction of constant dimension codes
- Construction of constant dimension codes in some cases
- Construction of constant dimension codes in some cases
- Constructions of cyclic constant dimension codes
- Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction
- On the extendability of particular classes of constant dimension codes
- Construction of optimal constant-dimension subspace codes
- A New Construction for Constant-Composition Codes
Cites work
- Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
- Bilinear forms over a finite field, with applications to coding theory
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- 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
- Coset Construction for Subspace Codes
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Generalized Linkage Construction for Constant-Dimension Codes
- New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes
- Optimal Ferrers Diagram Rank-Metric Codes
- Subspace Codes
- Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
This page was built for publication: Enhancing Echelon-Ferrers construction for constant dimension code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103101)