Let $\widetilde {\alpha} $ be a length-$ L $ cyclic sequence of characters from a size-$ K $
alphabet $\mathcal {A} $ such that the number of occurrences of any length-$ m $ string on …

De Bruijn sequences are circular strings of length 2n whose substrings are the binary strings
of length n. Our focus is on de Bruijn sequences for binary strings that have the same density …

De Bruijn sequences are circular strings of length 2^n whose length n substrings are the
binary strings of length n. Our focus is on creating circular strings of length nw for the binary …

The greedy Prefer-same de Bruijn sequence construction was first presented by Eldert et
al.[AIEE Transactions 77 (1958)]. As a greedy algorithm, it has one major downside: it …

A de Bruijn sequence is a circular binary string of length 2 n that contains each binary string
of length n exactly once as a substring. A maximum-density de Bruijn sequence is a circular …

A de Bruijn sequence is a circular binary string of length 2n that contains each binary string
of length n exactly once as a substring. A maximum-density de Bruijn sequence is a circular …

A k-ary de Bruijn sequence of order n is a cyclic sequence of length kn in which each k-ary
string of length n appears exactly once as a substring. A shift rule for a de Bruijn sequence of …

A (non-circular) de Bruijn sequence w of order n is a word such that every word of length n
appears exactly once in w as a factor. In this paper, we generalize the concept to different …

We give a complete proof of the following theorem: Every de Bruijn sequence of order n in at
least three symbols can be extended to a de Bruijn sequence of order n+ 1. Every de Bruijn …

A cut-down de Bruijn sequence is a cyclic string of length L, where 1≤ L≤ kn, such that
every substring of length n appears at most once. Etzion [Theor. Comp. Sci 44 (1986)] …