An application of difference sets to a problem concerning graphical codes (Q1365509)
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: An application of difference sets to a problem concerning graphical codes |
scientific article; zbMATH DE number 1057374
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An application of difference sets to a problem concerning graphical codes |
scientific article; zbMATH DE number 1057374 |
Statements
An application of difference sets to a problem concerning graphical codes (English)
0 references
4 September 1997
0 references
The authors prove that a binary code generated by a complete graph on \(n\) nodes is contained in some Hamming code if and only if \(n=2,3\), or 6.
0 references
difference set
0 references
binary code
0 references
Hamming code
0 references
0.9067368
0 references
0 references
0 references
0.89042735
0 references
0.88574946
0 references
0.88207555
0 references
0 references
0.88071537
0 references
