This paper presents a table of upper and lower bounds on <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">dₘₐₓ (n,k)</tex> , the maximum minimum distance over all binary, linear <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(n,k)</tex> error-correcting codes. The table is obtained by combining the best of the existing bounds on <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">dₘₐₓ (n,k)</tex> with the minimum distances of known codes and a variety of code-construction techniques.
No takes yet. Share an insight, caveat, or question.
Helgert et al. (1973) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: