Some lower bounds for constant weight codes

David Knight

Research output: Contribution to journalArticlepeer-review


Fifty-five new or improved lower bounds for A(n, d, w), the maximum possible number of binary vectors of length n, weight w, and pairwise Hamming distance no less than d, are presented.
Original languageEnglish
Pages (from-to)165 - 168
Number of pages3
JournalArs Combinatoria,
Publication statusE-pub ahead of print - 1 Oct 2009


  • constant-weight codes
  • coding theory


Dive into the research topics of 'Some lower bounds for constant weight codes'. Together they form a unique fingerprint.

Cite this