Title :
Six new binary quasi-cyclic codes
Author_Institution :
Dept. of Electr. Eng., Linkoping Univ., Sweden
fDate :
9/1/1994 12:00:00 AM
Abstract :
Six new quasi-cyclic codes are presented, which improve the lower bounds on the minimum distance for a binary code. A local exhaustive search is used to find these codes and many other quasi-cyclic codes which attain the lower bounds.
Keywords :
binary sequences; cyclic codes; search problems; binary quasi-cyclic codes; local exhaustive search; lower bounds; minimum distance; Algebra; Binary codes; Convolutional codes; Lattices; Linear code; Maximum likelihood decoding; Notice of Violation; Polynomials; Viterbi algorithm;
Journal_Title :
Information Theory, IEEE Transactions on
