Answers are grounded in this paper and cite their sources.
A lower bound is given on the size of a linear code of given length and distance which improves the Varshamov bound in certain cases, though not asymptotically. Specific triples(n,k,d)are given with values larger than those guaranteed by the Varshamov bound.
No takes yet. Share an insight, caveat, or question.
Michele Elia (1983) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: