Computerised search for linear binary codes

A computerised search procedure is described for finding new binary codes The method involves the extension of a given known code by annexing a number of parity-check digits to it in such a way that the minimum Hamming distance of the given code is improved. A number of codes found by this procedure have better rates than the best known codes of identical Hamming distance and the same number of information digits; a table of these codes is presented.