Flag codes: distance vectors and cardinality bounds
From MaRDI portal
Publication:2093501
Recommendations
Cites work
- An algebraic approach for decoding spread codes
- An orbital construction of optimum distance flag codes
- Bounds for flag codes
- Coding for Errors and Erasures in Random Network Coding
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- Error-Correcting Codes in Projective Space
- Flag codes from planar spreads in network coding
- Flag codes of maximum distance and constructions using Singer groups
- Improved upper bounds for partial spreads
- Johnson type bounds on constant dimension codes
- Message encoding and retrieval for spread and cyclic orbit codes
- Network coding and subspace designs
- Network coding with flags
- Network information flow
- Optimum distance flag codes from spreads via perfect matchings in graphs
- Partial spreads in random network coding
Cited in
(7)- Flag codes from planar spreads in network coding
- Bounds for flag codes
- Flag codes of maximum distance and constructions using Singer groups
- Flag Codes: Distance Vectors and Cardinality Bounds
- Optimum distance flag codes from spreads via perfect matchings in graphs
- Maximum flag-rank distance codes
- Codes from flag varieties over a finite field
This page was built for publication: Flag codes: distance vectors and cardinality bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2093501)