Counting Runs of Ones with Overlapping Parts in Binary Strings Ordered Linearly and Circularly
Frosso S. Makri, Zaharias M. Psillakis, Anastasios N. Arapis · International Journal of Statistics and Probability · 2013
On a binary $(0-1)$ string of length $n$ the $\ell$-overlapping counting scheme of runs of $1$ s of a fixed length $k$ is considered. According to this scheme, a run of 1s of length $k$ which is counted may have overlapping part of length at most $\ell$, $0\leq \ell