Minimum-distance bounds for binary linear codes

This paper presents a table of upper and lower bounds on
d_{max} (n,k)
, the maximum minimum distance over all binary, linear
(n,k)
error-correcting codes. The table is obtained by combining the best of the existing bounds on
d_{max} (n,k)
with the minimum distances of known codes and a variety of code-construction techniques.