Twelve new quasi-cyclic (QC) codes are presented which improve the bou
nds on the best known binary linear codes. They are rate (m - r)/pm, r
> 1, codes constructed by deleting r rows from the circulant matrices
of rate m/pm QC codes, based on the factors of x(m)-1. Heuristic comb
inatorial optimization was used to find these codes.