Efficient construction of long orientable sequences
From MaRDI portal
Cites work
- A framework for constructing de Bruijn sequences via simple successor rules
- A new algorithm for the generation of binary de Bruijn sequences
- A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Algorithms for the generation of full-length shift- register sequences
- An algorithm for generating shift-register cycles
- An efficient algorithm for the generation of DeBruijn cycles
- Avoidability index for binary patterns with reversal
- Constructing Orientable Sequences
- Constructing the first (and coolest) fixed-content universal cycle
- Efficient universal cycle constructions for weak orders
- scientific article; zbMATH DE number 721894 (Why is no real title available?)
- scientific article; zbMATH DE number 721897 (Why is no real title available?)
- scientific article; zbMATH DE number 2235059 (Why is no real title available?)
- Lexicographically least circular substrings
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
- On the aperiodic avoidability of binary patterns with variables and reversals
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- On the possibility, to travel around a graph without repetition and without cutting
- Ranking Bracelets in Polynomial Time.
- Self-dual sequences
Cited in
(4)
This page was built for publication: Efficient construction of long orientable sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891081)
