Abstract
In this paper we apply evolutionary methods to find finite binary ±1-sequences with low out-of-phase aperiodic auto-correlations. These sequences have important applications in communication or statistical mechanics, but their construction is a difficult computational problem. The Golay Factor of Merit is studied from a probabilistic point of view, in order to explain the poor efficiency of evolutionary algorithms. Various genetic algorithms are then proposed and tested.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beenker, G.F.M., Claasen, T.A.C.M., Hermens, P.W.C.: Binary sequences with maximally flat amplitude spectrum. Philips J. Res. 40, 289–304 (1985)
Bernasconi, J.: Low autocorrelation binary sequences: statistical mechanics and configuration space analysis. J. Physique 48, 559 (1987)
Golay, M.J.E.: The merit factor of long low autocorrelation binary sequences. IEEE Trans. Inf. theory IT-23, 43–51 (1982)
Golay, M.J.E.: The merit factor of Legendre sequences. IEEE Trans. Inf. theory IT-29, 934–936 (1983)
de Groot, C., Würtz, D., Hoffmann, K.H.: Low Autocorrelation Binary Sequences: Exact Enumeration and Optimization by Evolutionary Strategies. Optimization 23, 369–384 (1992)
Høholdt, T.: The Merit Factor of Binary sequences. In: pott, A., et al. (eds.) Difference Sets, Sequences and their Correlation Properties. Series C: mathematical and Physical Sciences, vol. 542, pp. 227–237. Kluwer Acad. Publish, Dordrecht (1999)
Jensen, J.M., Elbrønd Jensen, H., Høholdt, T.: The Merit Factor of Binary Sequences Related to Difference Sets. IEEE Trans. Inform. Theory 37-3, 617–626 (1991)
Knuth, D.E.: The Art of Computer Programming, 2nd edn. Seminumerical Algorithms, vol. 2. Addison-Wesley, Reading (1981)
Mertens, S.: Exhaustive search for low-autocorrelation binary sequences. J. Phys. A: Math. Gen. 29, 473–481 (1996)
Parker, M.G.: Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation. In: Bozta, S., Sphparlinski, I. (eds.) AAECC 2001. LNCS, vol. 2227, pp. 200–210. Springer, Heidelberg (2001)
Prestwich, S.: A Hybrid Local Search Algorithm for Low-Autocorrelation Binary Sequences, Tech. Report TR-00-01, Dept. Comp. Sci., National Univ. Ireland at Cork, pp. 14
Schroeder, M.R.: Number Theory in Science and Communication. Springer, Berlin (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aupetit, S., Liardet, P., Slimane, M. (2004). Evolutionary Search for Binary Strings with Low Aperiodic Auto-correlations. In: Liardet, P., Collet, P., Fonlupt, C., Lutton, E., Schoenauer, M. (eds) Artificial Evolution. EA 2003. Lecture Notes in Computer Science, vol 2936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24621-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-24621-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21523-3
Online ISBN: 978-3-540-24621-3
eBook Packages: Springer Book Archive