A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles
From MaRDI portal
Publication:5211627
DOI10.1109/TIT.2019.2928292zbMath1433.94079OpenAlexW2961176507MaRDI QIDQ5211627
Daniel Gabric, Dennis Wong, Aaron Williams, Joe Sawada
Publication date: 28 January 2020
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2019.2928292
Related Items (8)
A universal cycle for strings with fixed-content (which are also known as multiset permutations) ⋮ Enumerations of universal cycles for \(k\)-permutations ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ Avoidance of split overlaps ⋮ An efficiently generated family of binary de Bruijn sequences ⋮ On the \(k\)-error linear complexities of De Bruijn sequences ⋮ Efficient universal cycle constructions for weak orders ⋮ Shortened universal cycles for permutations
This page was built for publication: A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles
