Construction of optimal flag codes by MRD codes
From MaRDI portal
Cites work
- A Rank-Metric Approach to Error Control in Random Network Coding
- Bilateral multilevel construction of constant dimension codes
- Bilinear forms over a finite field, with applications to coding theory
- Bounds for flag codes
- Coding for Errors and Erasures in Random Network Coding
- Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
- Constructions of optimum distance full flag codes
- Degenerate flag varieties in network coding
- Double Multilevel Constructions for Constant Dimension Codes
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Flag codes from planar spreads in network coding
- Flag codes: distance vectors and cardinality bounds
- Johnson type bounds on constant dimension codes
- Maximum flag-rank distance codes
- Maximum-rank array codes and their application to crisscross error correction
- Network coding with flags
- Network information flow
- Optimum distance flag codes from spreads via perfect matchings in graphs
- Parallel Multilevel Constructions for Constant Dimension Codes
- Partial t-spreads and group constructible \((s,r,\mu)\)-nets
- Rank-metric codes and their applications
- The maximum size of a partial spread in a finite projective space
- Theory of codes with maximum rank distance
Cited in
(2)
This page was built for publication: Construction of optimal flag codes by MRD codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956579)
