An application of difference sets to a problem concerning graphical codes (Q1365509): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3737429 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decoding of graph theoretic codes (Corresp.) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph theoretic error-correcting codes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphical codes revisited / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4717031 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4146667 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The diophantine equation \(x^2+7=2^n\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3946078 / rank | |||
Normal rank | |||
Revision as of 17:36, 27 May 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
