Minimum-distance bounds for binary linear codes
Hermann J. Helgert, R. Stinaff · IEEE Transactions on Information Theory · 1973
This paper presents a table of upper and lower bounds ond_{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 ond_{max} (n,k)with the minimum distances of known codes and a variety of code-construction techniques.