Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach
In this paper we consider the distribution of a pattern of interest in a binary random $(d,k)$-sequence generated by a Markov source. Such constrained sequences are frequently encountered in communication systems. Unlike previous approach based on generating function we have chosen here to use...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2008-08-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/739 |