Waiting time distributions for pattern occurrence in a constrained sequence
Authors: Valeri T. Stefanov ; Wojciech Szpankowski
NULL##NULL
Valeri T. Stefanov;Wojciech Szpankowski
A binary sequence of zeros and ones is called a (d; k)-sequence if it does not contain runs of zeros of length either lessthan d or greater than k, where d and k are arbitrary, but fixed, non-negative integers and d < k. Such sequences find requires that (d; k)-sequences do not contain a specific pattern w. Therefore, distribution results concerning pattern occurrence in (d; k)-sequences are of interest. In this paper we study the distribution of the waiting time until the r-th occurrence of a pattern w in a random (d; k)-sequence generated by a Markov source. Numerical examples are also provided.
Collaborative Research: Nonlinear Equations Arising in Information Theory and Computer Sciences; Funder: National Science Foundation; Code: 0503742
Analytic Information Theory, Combinatorics, and Algorithmics: The Precise Redundancy and Related Problems; Funder: National Science Foundation; Code: 0208709
Crossroads of Information Theory and Computer Science: Analytic Algorithmics, Combinatorics, and Information Theory; Funder: National Science Foundation; Code: 0513636