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.
|Pages (from-to)||165 - 168|
|Number of pages||3|
|Publication status||E-pub ahead of print - 1 Oct 2009|
- constant-weight codes
- coding theory