An efficient shift rule for the prefer-max de Bruijn sequence

DOI10.1016/j.disc.2018.09.024zbMath1400.05004arXiv1706.01106OpenAlexW2622212042MaRDI QIDQ1618243

R. Smith

Publication date: 13 November 2018

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

Full work available at URL: https://arxiv.org/abs/1706.01106

zbMATH Keywords

de Bruijn sequenceFord sequenceshift ruleprefer-max sequence

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (3)

Extending de Bruijn sequences to larger alphabets ⋮ An efficient generalized shift-rule for the prefer-max de Bruijn sequence ⋮ On the \(k\)-error linear complexities of De Bruijn sequences

Cites Work

• Unnamed Item
• A surprisingly simple de Bruijn sequence construction
• Lexicographic compositions and de Bruijn sequences
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
• Generation of the Ford sequence of length \(2^ n\), n large
• Factorizing words over an ordered alphabet
• An algorithm for constructing m-ary de Bruijn sequences
• Generating necklaces
• Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
• Free differential calculus. IV: The quotient groups of the lower central series

This page was built for publication: An efficient shift rule for the prefer-max de Bruijn sequence