On constant weight codes and harmonious graphs

[摘要] 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.

[学科分类] 计算机科学（综合）