Some results on the existence of binary linear codes (Corresp.)

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.