Multilevel constructions of constant dimension codes based on one-factorization of complete graphs
From MaRDI portal
Cites work
- A course in combinatorics.
- A Rank-Metric Approach to Error Control in Random Network Coding
- 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
- Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
- Construction of subspace codes through linkage
- Constructions for Optimal Ferrers Diagram Rank-Metric Codes
- Constructions of optimal Ferrers diagram rank metric codes
- Constructions of optimal rank-metric codes from automorphisms of rational function fields
- Coset Construction for Subspace Codes
- Double Multilevel Constructions for Constant Dimension Codes
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations
- New constant dimension subspace codes from multilevel linkage construction
- New LMRD Code Bounds for Constant Dimension Codes and Improved Constructions
- Optimal Ferrers Diagram Rank-Metric Codes
- Optimal Ferrers diagram rank-metric codes from MRD codes
- Parallel Multilevel Constructions for Constant Dimension Codes
- Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks
- Theory of codes with maximum rank distance
This page was built for publication: Multilevel constructions of constant dimension codes based on one-factorization of complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391757)
