Optimum distance flag codes from spreads via perfect matchings in graphs (Q825551)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7447679
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimum distance flag codes from spreads via perfect matchings in graphs |
scientific article; zbMATH DE number 7447679 |
Statements
Optimum distance flag codes from spreads via perfect matchings in graphs (English)
0 references
17 December 2021
0 references
network coding
0 references
subspace codes
0 references
spreads
0 references
flag codes
0 references
graphs
0 references
perfect matching
0 references
maximum distance
0 references
0.8918639
0 references
0.8854673
0 references
0.86890554
0 references
0 references
0 references
0 references
0.8588928
0 references
0.8588633
0 references
