On Constant Weight Codes and Harmonious Graphs.

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. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1979
Accession Number
ADA083176

Entities

People

  • N. J. A. Sloane
  • R. L. Graham

Organizations

  • Stanford University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Additives (Chemicals)
  • California
  • Computer Science
  • Computers
  • Graph Theory
  • Literature
  • Military Research
  • Number Theory
  • Numbers
  • Set Theory
  • Theorems
  • United States
  • United States Government
  • Universities

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Educational Psychology
  • Graph Algorithms and Convex Optimization.
  • Theoretical Analysis.