Search of periodic binary code compressed to several subpulses using simulated annealing and hill climbing

Periodic binary codes, which are compressed to a signal with a width of several subpulses and small sidelobes, are searched using simulated annealing and hill climbing methods, because they can not be found by exhaustive searches. We found new codes with lengths of 53 and 55 and that the peak-sidelobe to peak-mainlobe ratios are smaller than such conventional codes as M-sequences.