A (105, 10, 47) binary quasi-cyclic code is presented which improves t
he known lower bound on the maximum possible minimum distance. The gen
erator matrix is characterized in terms of m x m circulant matrices, w
here 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 dist
ributions of these codes are presented.