Research problems on Gray codes and universal cycles

DOI10.1016/J.DISC.2009.04.002MaRDI QIDQ1044897zbMATH OpenOpenAlexWikidataFDO

Authors 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

zbMATH Keywords

Gray codesopen problemsde Bruijn cycles

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Cyclic codes (94B15) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06)

Cited in

(10)

• A universal cycle for strings with fixed-content (which are also known as multiset permutations)
• Locating patterns in the de Bruijn torus
• Constructing the first (and coolest) fixed-content universal cycle
• 1-overlap cycles for Steiner triple systems
• Recursive reconstruction of piecewise constant signals by minimization of an energy function
• Cut-down de Bruijn sequences
• Generating Gray codes for weak orders in constant amortized time
• Efficient universal cycle constructions for weak orders
• Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set
• Enumerations of universal cycles for \(k\)-permutations

This page was built for publication: Research problems on Gray codes and universal cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044897)