Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence

DOI10.1016/j.ejc.2018.03.006zbMath1455.94097OpenAlexW2799851485MaRDI QIDQ1645055

Dennis Wong, Aaron Williams, Joe Sawada, Patrick Baxter Dragon, Oscar I. Hernandez

Publication date: 28 June 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2018.03.006

zbMATH Keywords

\(k\)-ary de Bruijn sequence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (8)

An efficient shift rule for the prefer-max de Bruijn sequence ⋮ Constructing de Bruijn sequences by concatenating smaller universal cycles ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ Quantum algorithm for lexicographically minimal string rotation ⋮ An efficiently generated family of binary de Bruijn sequences ⋮ A framework for constructing de Bruijn sequences via simple successor rules ⋮ Investigating the discrepancy property of de Bruijn sequences ⋮ On greedy algorithms for binary de Bruijn sequences

Cites Work

• Unnamed Item
• Unnamed Item
• The lexicographically smallest universal cycle for binary strings with minimum specified weight
• Corrigendum to ``On the theorem of Fredricksen and Maiorana about de Bruijn sequences
• A simple shift rule for \(k\)-ary de Bruijn sequences
• The discrepancy of the lex-least de Bruijn sequence
• Minimum Eulerian circuits and minimum de Bruijn sequences
• An algorithm for generating necklaces of beads in two colors
• Lexicographically least circular substrings
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
• On the theorem of Fredricksen and Maiorana about de Bruijn sequences
• Generalized de Bruijn words for primitive words and powers
• Generation of the Ford sequence of length \(2^ n\), n large
• Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
• The Grandmama de Bruijn Sequence for Binary Strings
• De Bruijn Sequences for Fixed-Weight Binary Strings
• Factorizing words over an ordered alphabet
• A new algorithm for the generation of binary de Bruijn sequences
• Generating necklaces

This page was built for publication: Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence