Answers are grounded in this paper and cite their sources.
With the Delsarte-MacWilliams inequalities as a starting point, an upper bound is obtained on the rate of a binary code as a function of its minimum distance. This upper bound is asymptotically less than Levenshtein's bound, and so also Elias's.
No takes yet. Share an insight, caveat, or question.
McEliece et al. (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: