An Efficient Algorithm for Generating Necklaces with Fixed Density

A bracelet is the lexicographically smallest element in an equivalence class of strings under string rotation and reversal. We present a fast, simple, recursive algorithm for generating (i.e., listing) k-ary bracelets. Using simple bounding techniques, ...

In a recent report, Gulliver and Speidel showed that complete sets of aperiodic and - in some cases periodic - necklaces can be generated for arbitrary lengths as fixed-length subsets of variable-length T-codes. The T-codes to which they applied this ...

A de Bruijn sequence is a circular binary string of length 2ⁿ that contains each binary string of length n exactly once as a substring. A maximum-density de Bruijn sequence is a circular binary string of length n (n 0)+(n 1)+(n 2)+...+(n m) that ...