New codes from chains of quasi-cyclic codes

Well known constructions are applied to chains of quasi-cyclic codes in order to achieve new codes that improve on best known bounds on the minimum distance. These techniques have previously been successfully applied to chains of cyclic and algebraic-geometric codes. In conjunction with an improved algorithm for computing the minimum weight of quasi-cyclic codes, the constructions have so far yielded 274 new codes improving the lower bounds