Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach

Abstract : 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 the previous approach based on generating function we have chosen here to use Markov chain embedding techniques. By doing so, we get both previous results (sequence constrained up to the rth occurrence), and new ones (sequence constrained up to its end). We also provide in both cases efficient algorithms using basic linear algebra only. We then compare our numerical results to previous ones and finally propose several interesting extensions of our method which further illustrate the usefulness of our approach. That is to say higher order Markov chains, renewal occurrences rather than overlapping ones, heterogeneous models, more complex patterns of interest, and multistate trial sequences.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2008, 10 (3), pp.149-160
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00271314
Contributeur : Christine Graffigne <>
Soumis le : mardi 3 juin 2014 - 14:49:14
Dernière modification le : mardi 11 octobre 2016 - 13:24:40

Fichier

739-3734-1-PB.pdf
Accord explicite pour ce dépôt

Identifiants

  • HAL Id : hal-00271314, version 1

Collections

Citation

Gregory Nuel. Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2008, 10 (3), pp.149-160. <hal-00271314>

Partager

Métriques

Consultations de
la notice

86

Téléchargements du document

71