Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences

Documenti analoghi

• Universal cycle constructions for k-subsets and k-multisets
  di: Campbell, Colin, et al.
  Pubblicazione: (2026)
• Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
  di: Sawada, Joe, et al.
  Pubblicazione: (2025)
• Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
  di: Gabrić, Daniel, et al.
  Pubblicazione: (2024)
• Construction of orientable sequences in $O(1)$-amortized time per bit
  di: Gabric, Daniel, et al.
  Pubblicazione: (2024)
• Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions
  di: Sawada, J., et al.
  Pubblicazione: (2023)