A class of rate 2/p quasi-cyclic codes can be characterized in terms o
f m x m circulant matrices. In this correspondence, two new codes with
parameters (80, 10, 35) and (95, 10, 42) are presented which improve
the known lower bound on the maximum possible minimum distance. The fo
rmer code can be extended with an even parity check bit to an (81, 10,
36) code that establishes that d(2)(81, 10) = 36.