Research problems on Gray codes and universal cycles
From MaRDI portal
Publication:1044897
DOI10.1016/j.disc.2009.04.002zbMath1197.05002OpenAlexW1994156427WikidataQ29544000 ScholiaQ29544000MaRDI QIDQ1044897
Brad Jackson, Brett Stevens, Glenn H. Hurlbert
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.04.002
Permutations, words, matrices (05A05) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Cyclic codes (94B15)
Related Items (9)
A universal cycle for strings with fixed-content (which are also known as multiset permutations) ⋮ Enumerations of universal cycles for \(k\)-permutations ⋮ Recursive reconstruction of piecewise constant signals by minimization of an energy function ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ Locating patterns in the de Bruijn torus ⋮ Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set ⋮ 1-overlap cycles for Steiner triple systems ⋮ Generating Gray codes for weak orders in constant amortized time ⋮ Efficient universal cycle constructions for weak orders
This page was built for publication: Research problems on Gray codes and universal cycles
