BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-79-777
       ENTRY:: June 19, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: On constant weight codes and harmonious graphs
        TYPE:: Technical Report
      AUTHOR:: Graham, Ronald L.
      AUTHOR:: Sloane, Neil J. A.
        DATE:: December 1979
       PAGES:: 18
    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.
       NOTES:: [Adminitrivia V1/Prg/19950619]
         END:: STAN//CS-TR-79-777