论文信息 - A Simple Combinatorial Algorithm for de Bruijn Sequences

A Simple Combinatorial Algorithm for de Bruijn Sequences

Abstract This paper presents a combinatorial method to construct a de Bruijn sequence for any order n. The method is similar to that of the well-known prefer-one algorithm. The resulting sequences are compared and both methods are shown to be special cases of a unifying graph construction that is capable of generating all de Bruijn sequences.

Abbas Alhakim | Abbas Alhakim

[1] Joshua N. Cooper,et al. Generalized de Bruijn Cycles , 2004, math/0402324.

[2] de Ng Dick Bruijn. A combinatorial problem , 1946 .

[3] Hu Chuan-Gan,et al. On The Shift Register Sequences , 2004 .

[4] H. Fredricksen. A Survey of Full Length Nonlinear Shift Register Cycle Algorithms , 1982 .

[5] Carla Savage,et al. A Survey of Combinatorial Gray Codes , 1997, SIAM Rev..

[6] Fan Chung Graham,et al. Universal cycles for combinatorial structures , 1992, Discret. Math..

[7] Donald E. Knuth,et al. The Art of Computer Programming: Volume IV: Fascicle 2: Generating All Tuples and Permutations , 2005 .

[8] David Thomas,et al. The Art in Computer Programming , 2001 .