Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 (Q1727355): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s10623-018-0544-8 / rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q129300699 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S10623-018-0544-8 / rank | |||
Normal rank |
Latest revision as of 06:02, 11 December 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
0 references
0 references
0 references
0 references