Skip to Main Content
Genetic algorithms have been used successfully for solving different combinatorial optimization problems. We give here an efficient algorithm for the search of good double-circulant codes. The algorithm presented is intended to generate a double-circulant code with maximum minimum distance for each length. Some results are presented and validated by exact method, others promising results are also presented for long double-circulant codes.