Universal Cycles for Weight-Range Binary Strings
From MaRDI portal
Publication:2870044
DOI10.1007/978-3-642-45278-9_33zbMath1407.68580OpenAlexW2095842254MaRDI QIDQ2870044
Aaron Williams, Joe Sawada, Dennis Wong
Publication date: 17 January 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-45278-9_33
Related Items (9)
A universal cycle for strings with fixed-content (which are also known as multiset permutations) ⋮ Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles ⋮ Constructing de Bruijn sequences by concatenating smaller universal cycles ⋮ Properties of the cycles that contain all vectors of weight \(\le k\) ⋮ The lexicographically smallest universal cycle for binary strings with minimum specified weight ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ A surprisingly simple de Bruijn sequence construction ⋮ A framework for constructing de Bruijn sequences via simple successor rules ⋮ Investigating the discrepancy property of de Bruijn sequences
This page was built for publication: Universal Cycles for Weight-Range Binary Strings
