Text Size: ππππ

CECM Home > Events > CECM Annual Summer Meeting 2005 > Program > Poster Abstract: Ron Ferguson

CECM 05 Home Registration Poster Session Social Event Program Participants Photo Gallery

Poster Abstract

Optimization Methods for Binary Sequences — The Merit Factor Problem

Ron Ferguson

Optimization procedures for binary sequences, applied in particular to the merit factor problem, have been a subject of much interest in combinatorial optimization, communications engineering, and analytic number theory. Exact methods have confirmed optimal sequences up to length 60, but this is not far enough to adequately make projections. We combine both stochastic and non-stochastic search methods to obtain what we consider comprehensive results to length 90 in general and to length 180 for restriction to skew-symmetric sequences and develop statistical arguments to support this claim.