A new algorithm for the generation of binary de Bruijn sequences
From MaRDI portal
Recommendations
Cited in
(30)- An algorithm for generating shift-register cycles
- Algorithm for the generation of nonlinear de Bruijn sequences
- 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
- Storage efficient decoding for a class of binary de Bruijn sequences
- An efficiently generated family of binary de Bruijn sequences
- Investigating the discrepancy property of de Bruijn sequences
- On greedy algorithms for binary de Bruijn sequences
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence
- Algorithms for the generation of full-length shift- register sequences
- An efficient algorithm for the generation of DeBruijn cycles
- A new algorithm of generating binary M sequences
- An algorithm for constructing m-ary de Bruijn sequences
- scientific article; zbMATH DE number 4045636 (Why is no real title available?)
- scientific article; zbMATH DE number 4081462 (Why is no real title available?)
- scientific article; zbMATH DE number 123794 (Why is no real title available?)
- scientific article; zbMATH DE number 500267 (Why is no real title available?)
- scientific article; zbMATH DE number 221327 (Why is no real title available?)
- A surprisingly simple de Bruijn sequence construction
- scientific article; zbMATH DE number 2192127 (Why is no real title available?)
- A recursive algorithm for generating k-ary de Bruijn sequences
- A BWT-based algorithm for random de Bruijn sequence construction
- On extremal factors of de Bruijn-like graphs
- New successor rules to efficiently produce exponentially many binary de Bruijn sequences
- Efficient construction of long orientable sequences
- Constructing k-ary orientable sequences with asymptotically optimal length
- Efficient constructions of the prefer-same and prefer-opposite de Bruijn sequences
- A simple shift rule for \(k\)-ary de Bruijn sequences
- The discrepancy of the lex-least de Bruijn sequence
This page was built for publication: A new algorithm for the generation of binary de Bruijn sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474273)