Search of binary codes compressed to several subpulses using genetic algorithm

Abstract

Binary codes, which are compressed to a signal with a width of several subpulses and small sidelobes, are searched using a genetic algorithm because they cannot be found by exhaustive search. We found new codes with longer code length and that the peak-sidelobe to peak-mainlobe ratios are smaller than such conventional codes as Barker codes and optimum binary codes. We also indicate the characteristics of the codes.