A de Bruijn sequence construction by concatenating cycles of the complemented cycling register

DOI10.1007/978-3-319-66396-8_6MaRDI QIDQ1678337zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Daniel Gabric, Joe Sawada

Publication date 15 November 2017

Full work available at URL https://doi.org/10.1007/978-3-319-66396-8_6

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• A surprisingly simple de Bruijn sequence construction
• A framework for constructing de Bruijn sequences via simple successor rules
• A recursive construction of nonbinary de Bruijn sequences
• Constructing de Bruijn sequences by concatenating smaller universal cycles
• A generalized recursive construction for de Bruijn sequences

Cited in

(10)

• De Bruijn sequences and suffix arrays: analysis and constructions
• Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
• Constructing de Bruijn sequences by concatenating smaller universal cycles
• A framework for constructing de Bruijn sequences via simple successor rules
• Investigating the discrepancy property of de Bruijn sequences
• An efficient generalized shift-rule for the prefer-max de Bruijn sequence
• The grandmama de Bruijn sequence for binary strings
• A surprisingly simple de Bruijn sequence construction
• A recursive construction of nonbinary de Bruijn sequences
• The discrepancy of the lex-least de Bruijn sequence

This page was built for publication: A de Bruijn sequence construction by concatenating cycles of the complemented cycling register

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