[IEEE Trans. on Information Theory, November 2001, pp. 2373-2395]
A Table of Upper Bounds for Binary Codes
Erik Agrell, Alexander Vardy, and Kenneth Zeger
Abstract
Let A(n,d) denote the maximum possible number of
codewords in an (n,d) binary code. We establish 4
new bounds on A(n,d), namely A(21,4) ≤ 43689,
A(22,4) ≤ 87378, A(22,6) ≤ 6941, and A(23,4) ≤ 173491.
Furthermore, using recent 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≤ 28. This table
extends the range of parameters compared with previously known tables.