Title :
Two new rate 2/p binary quasi-cyclic codes
Author :
Gulliver, T. Aaron ; Bhargava, Vijay K.
Author_Institution :
Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada
fDate :
9/1/1994 12:00:00 AM
Abstract :
A class of rate 2/P quasi-cyclic codes can be characterized in terms of m×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 d2(81, 10)=36
Keywords :
binary sequences; cyclic codes; matrix algebra; binary quasi-cyclic codes; circulant matrices; code parameters; even parity check bit; linear code; lower bound; maximum possible minimum distance; Algebra; Character generation; Hamming weight; Linear code; Parity check codes; Polynomials;
Journal_Title :
Information Theory, IEEE Transactions on
