An application of difference sets to a problem concerning graphical codes (Q1365509): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:05, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An application of difference sets to a problem concerning graphical codes |
scientific article |
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
