A (105,10,47) binary quasi-cyclic code Original Research Article

A (105, 10, 47) binary quasi-cyclic code is presented which improves the known lower bound on the maximum possible minimum distance. The generator matrix is characterized in terms of m × m circulant matrices, where m = 5. This code is extended with an even parity check bit to a (106, 10, 48) code which also improves the known bound. The weight distributions of these codes are presented.