Notes on de Bruijn sequences

DOI10.1016/0166-218X(87)90072-2MaRDI QIDQ1089804zbMATH OpenFDO

Authors Shenquan Xie

Publication date 1987

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(87)90072-2

zbMATH Keywords

algorithmsgreatest de Bruijn sequencelook-up tablelook-up table labelsmini-cycle set

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Discrete mathematics in relation to computer science (68R99)

Review text

In this paper the concepts of look-up table, look-up table labels and mini-cycle set are introduced and used to present some algorithms for generating the greatest de Bruijn sequence DB(m,n) and all DB(m,n)'s. Also these algorithms are compared with the Martin algorithm and backtracking algorithms. In the appendix an algorithm for numerically generating r arrangements of n objects is presented.

Recommendations

• scientific article; zbMATH DE number 2188425
• Algorithms for the generation of full-length shift- register sequences
• An algorithm for constructing m-ary de Bruijn sequences
• scientific article; zbMATH DE number 500267
• An efficient algorithm for the generation of DeBruijn cycles

Cites work

• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• De Bruijn Sequences-A Model Example of the Interaction of Discrete Mathematics and Computer Science

Cited in

(17)

• Construction of infinite de Bruijn arrays
• Perfect factors in the de Bruijn graph
• New classes of perfect maps. I
• On extending de Bruijn sequences
• Multi de Bruijn sequences
• Test sequence construction using minimum information on the tested system
• Algorithms for the generation of full-length shift- register sequences
• scientific article; zbMATH DE number 5016615 (Why is no real title available?)
• Cryptographically Strong de Bruijn Sequences with Large Periods
• Projective de Bruijn Sequences
• An algorithm for constructing m-ary de Bruijn sequences
• scientific article; zbMATH DE number 12001 (Why is no real title available?)
• de Bruijn notation as a nested datatype
• DE BRUIJN SEQUENCES REVISITED
• scientific article; zbMATH DE number 2188425 (Why is no real title available?)
• On the existence of balanced generalized de Bruijn sequences
• Efficient constructions of the prefer-same and prefer-opposite de Bruijn sequences

This page was built for publication: Notes on de Bruijn sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089804)