Skip to Main Content
Simulated annealing is a statistical computational technique for obtaining approximate solutions to combinatorial optimization problems. An efficient simulated annealing algorithm is used to design binary sequence sets which have good autocorrelation and crosscorrelation properties. Some of the synthesized results are presented, and their properties are better than any other known in the literature. The synthesized binary sequence sets promise to be practically applicable.