Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 (Q1727355): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Cliquer / rank | |||
Normal rank | |||
Revision as of 12:06, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
