Distribution of patterns of constrained length in binary sequences
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3548141 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- A Mathematical Theory of Communication
- Block codes for a class of constrained noiseless channels
- Compound Poisson approximation for Markov chains using Stein's method
- Compound Poisson approximation for counts of rare patterns in Markov chains and extreme sojourns in birth-death chains.
- Compound Poisson approximations for word patterns under Markovian hypotheses
- Constrained (k,d)-out-of-n systems
- Counting certain binary strings
- Distribution theory of runs and patterns and its applications. A finite Markov chain imbedding approach
- Distributions of \((k_1,k_2,\dots ,k_m)\)-runs with multi-state trials
- Distributions of patterns of two successes separated by a string of k-2 failures
- Exact distributions of constrained (k, ) strings of failures between subsequent successes
- From runs to patterns
- Generalizations of distributions related to \((k_1,k_2)\)-runs
- Generalizations of runs and patterns distributions for sequences of binary trials
- On Consecutive Records in Certain Bernoulli Sequences
- On binomial distributions of order k
- On success runs of a fixed length in Bernoulli sequences: exact and asymptotic results
- On the distribution of runs of ones in binary strings
- Runs and scans with applications
- Scan statistics
- Sequence-state Methods for Run-length-limited Coding
- Simultaneous demonstration tests involving sparse failures
- Success run statistics defined on an urn model
- Waiting time distributions for pattern occurrence in a constrained sequence
- Weak runs in sequences of binary trials
This page was built for publication: Distribution of patterns of constrained length in binary sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204666)
