Arbitrary-length analogs to de Bruijn sequences

Abhinav Nellore, Rachel Ward

Let $\tilde{\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 $\mathcal{A}$…