Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances (Q5954078)
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: Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances |
scientific article; zbMATH DE number 1698504
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances |
scientific article; zbMATH DE number 1698504 |
Statements
Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances (English)
0 references
30 January 2002
0 references
perfect codes
0 references
isometry
0 references
perfect binary codes
0 references
graphs
0 references
minimum distances
0 references
