On computer search for good quasi-cyclic codes

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.<>