Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances (Q5954078): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(00)00356-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2050626721 / rank | |||
Normal rank |
Latest revision as of 11:08, 30 July 2024
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