De Bruijn Sequences with Varying Combs
Abbas Alhakim, Steve Butler, Ron L. Graham · Zenodo (CERN European Organization for Nuclear Research) · 2014
For a given alphabet A and length n, a de Bruijn sequence corresponds to a string of length |A|n where every string of length n occurs as a consecutive substring (and we allow the ends to wrap around). We consider the relaxation wherein the letters of the substring are not consecutive but rather fixed by some pattern, called a comb. We give several constructions showing how to construct some sequences for combs, as well as give several ways to form combs without de Bruijn sequences