An application of difference sets to a problem concerning graphical codes
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.
scientific article; zbMATH DE number 1057374