Tables with lower and upper bounds for d/sub max/ (n,k), the maximum possible minimum distance of a binary linear code with word length n and dimension k, are shown.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
No takes yet. Share an insight, caveat, or question.
Brouwer et al. (1993) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: