Disjoint Hamiltonian cycles in minimum distance graphs of 1-perfect codes (Q4595650)
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: Disjoint Hamiltonian cycles in minimum distance graphs of 1-perfect codes |
scientific article; zbMATH DE number 6815657
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Disjoint Hamiltonian cycles in minimum distance graphs of 1-perfect codes |
scientific article; zbMATH DE number 6815657 |
Statements
6 December 2017
0 references
binary Hamming code
0 references
nonlinear binary 1-perfect code
0 references
0.9172600507736206
0 references
0.794579029083252
0 references
0.7562103271484375
0 references
0.7459654211997986
0 references
0.7446504831314087
0 references
