Title :
On computer search for good quasi-cyclic codes
Author_Institution :
Dept. of Electr. Eng., Linkoping Univ., Sweden
fDate :
27 Jun-1 Jul 1994
Abstract :
As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. A lot of work has been done to find good QC codes with help of computers, and many good QC codes have been found. It should be noted that an exhaustive search is intractable with the increase in the code dimensions. In this paper, a local search method is used to find good binary QC codes
Keywords :
binary sequences; cyclic codes; linear codes; search problems; binary QC codes; binary quasi-cyclic codes; code dimensions; computer search; exhaustive search; linear codes; local search method; Algebra; Error correction codes; Linear code; Polynomials; Search methods;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394929
