Report Number: CS-TR-79-777
Institution: Stanford University, Department of Computer Science
Title: On constant weight codes and harmonious graphs
Author: Graham, Ronald L.
Author: Sloane, Neil J. A.
Date: December 1979
Abstract: Very recently a new method has been developed for finding
lower bounds on the maximum number of codewords possible in a
code of minimum distance d and length n. This method has led
in turn to a number of interesting questions in graph theory
and additive number theory. In this brief survey we summarize
some of these developments.