Binary codes with improved minimum weights (Corresp.)

A recent table of Helgert and Stinaff gives bounds for
d_{max}(n,k)
, the maximum minimum distance over all binary linear
(n,k)
error-correcting codes,
1 \leq k \leq n \leq 127
. Twelve new codes are constructed which improve lower bounds in the table. Two methods are employed: the algebraic puncturing technique of Solomon and Stiffler and generation by combinatorial incidence matrices.