Universal Cycles for Weight-Range Binary Strings

DOI10.1007/978-3-642-45278-9_33zbMATH Open1407.68580OpenAlexW2095842254MaRDI QIDQ2870044FDOQ2870044

Authors: Joe Sawada, Aaron Williams, 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

Recommendations

• The lexicographically smallest universal cycle for binary strings with minimum specified weight
• A universal cycle for strings with fixed-content (which are also known as multiset permutations)
• Counting cyclic binary strings
• The Structure and Properties of Binary Cyclic Alphabets
• scientific article; zbMATH DE number 3266248
• scientific article; zbMATH DE number 166128
• Universal cycles of classes of restricted words
• De Bruijn sequences for fixed-weight binary strings
• Universal cycles for permutations
• scientific article; zbMATH DE number 1594298

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited In (11)

• A universal cycle for strings with fixed-content (which are also known as multiset permutations)
• The lexicographically smallest universal cycle for binary strings with minimum specified weight
• Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
• Constructing the first (and coolest) fixed-content universal cycle
• Constructing de Bruijn sequences by concatenating smaller universal cycles
• Title not available (Why is that?)
• Cut-down de Bruijn sequences
• Properties of the cycles that contain all vectors of weight \(\le k\)
• Investigating the discrepancy property of de Bruijn sequences
• A surprisingly simple de Bruijn sequence construction
• A framework for constructing de Bruijn sequences via simple successor rules

This page was built for publication: Universal Cycles for Weight-Range Binary Strings

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