Sonmez, M.
(2012),
Evolutionary Construction of de Bruijn Sequences, Proceedings of the 4th ACM Workshop on Security and Artificial Intelligence, Chicago, IL, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=909087
(Accessed September 8, 2024)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Evolutionary Construction of de Bruijn Sequences
Published
Author(s)
Abstract
A binary de Bruijn sequence of order n is a cyclic sequence of period 2^n, in which each n-bit pattern appears exactly once. These sequences are commonly used in applications such as stream cipher design, pseudo-random number generation, 3-D pattern recognition, network modeling, mainly due to their good statistical properties. Constructing de Bruijn sequences is of interest and well studied in the literature. In this study, we propose a new randomized construction method based on genetic algorithms. The method models de Bruijn sequences as special type of traveling salesman tours and tries to find optimal solutions to this special type of the traveling salesman problem (TSP). We present some experimental results for nProceedings Title
Proceedings of the 4th ACM Workshop on Security and Artificial Intelligence
Conference Dates
October 21, 2011
Conference Location
Chicago, IL
Conference Title
4th Workshop on Artificial Intelligence and Security
Pub Type
Conferences
Download Paper
Keywords
De Bruijn sequences, genetic algorithms, traveling salesman problem
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created July 20, 2012, Updated February 19, 2017