A table of upper bounds for binary codes

Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish four new bounds on A(n, d), namely, A(21, 4)/spl les/43689, A(22, 4)/spl les/87378, A(22, 6)/spl les/6941, and A(23, 4)/spl les/173491. Furthermore, using previous upper bounds on the size of constant-weight binary codes, we reapply known methods to generate a table of bounds on A(n, d) for all n/spl les/28. This table extends the range of parameters compared with previously known tables.