Generating De Bruijn sequences: An efficient implementation

IEEE Transactions on Computers

Volumn 46, Issue 2, 1997, Pages 198-200

  Annexstein, F S ^a  

^a 705 Engineering Research Center   (United States)

Author keywords

Computational complexity; De Bruijn graphs; NESL programming language; Recursive algorithms; Shift register sequences

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; C (PROGRAMMING LANGUAGE); CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; GRAPH THEORY; NUMBER THEORY; PARALLEL PROCESSING SYSTEMS; RECURSIVE FUNCTIONS; THEOREM PROVING;

DE BRUIJN GRAPH; DE BRUIJN SEQUENCES; RECURSIVE ALGORITHM; SHIFT REGISTER SEQUENCES;

SHIFT REGISTERS;

EID: 0031075109     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.565596     Document Type: Article

References (6)

1. E.R. Berlekamp, Algebraic Coding Theory. Laguna Hills, Calif.: Aegean Park Press, 1984.
2. G.E. Blelloch, "NESL: A Nested Data-Parallel Language," Technical Report CM U-CS-94, Carnegie Mellon Univ., 1994.
3. H. Fredrickson, "A Survey of Full Cycle Algorithms," SIAM Review, vol. 24, pp. 195-221, 1982.
4. S.W. Golomb, Shift Register Sequences. San Franciso: Holden-Day, 1967.
5. A. Lempel, "On a Homomorphism of the De Bruijn Graph and Its Applications to the Design of Feedback Shift Registers," IEEE Trans. Computers, vol. 19, no. 12, pp. 1,204-1,209, Dec. 1970.
6. A. Ralston, "De Bruijn Sequences - A Model Example of the Interaction of Discrete Mathematics and Computer Science," Am. Math. Monthly, vol. 55, no. 3, pp. 131-143, May 1982.