Two new rate 2/p binary quasi-cyclic codes
Thomas Aaron Gulliver, V.K. Bhargava · IEEE Transactions on Information Theory · 1994
A class of rate 2/P quasi-cyclic codes can be characterized in terms of m/spl times/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 former code can be extended with an even parity check bit to an (81, 10, 36) code that establishes that d/sub 2/(81, 10)=36.>