Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 (Q1727355)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 |
scientific article |
Statements
Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 (English)
0 references
20 February 2019
0 references
network coding
0 references
constant-dimension codes
0 references
subspace distance
0 references
classification
0 references
integer linear programming
0 references
0 references
0 references
0 references
0 references
0.934578001499176
0 references
0.8361862301826477
0 references
0.8279292583465576
0 references
0.8012434840202332
0 references
0.7967438101768494
0 references
