Lengthening and the Gilbert-Varshamov bound
Yves Edel, Juergen Bierbrauer · IEEE Transactions on Information Theory · 1997
We use lengthening and an enhanced version of the Gilbert-Varshamov lower bound for linear codes to construct a large number of record-breaking codes. Our main theorem may be seen as a closure operation on databases.