Pattern Matching in Constrained Sequences

Yongwook Choi, Wojciech Szpankowski · 2007

Constrained sequences find applications in communication, magnetic recording, and biology. In this paper, we restrict our attention to the so-called (d, k) constrained binary sequences in which any run of zeros must be of length at least d and at most k, where 0lesd

Read the paper · More papers on PaperTik