Two new constructions of almost MFRD codes
From MaRDI portal
Cites work
- An asymptotically optimal construction of almost affinely disjoint subspaces
- Bilinear forms over a finite field, with applications to coding theory
- Coding for Errors and Erasures in Random Network Coding
- Coset Construction for Subspace Codes
- Degenerate flag varieties in network coding
- Generalized bilateral multilevel construction for constant dimension codes
- Maximum flag-rank distance codes
- Network coding with flags
- Network information flow
- 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
This page was built for publication: Two new constructions of almost MFRD codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285288)