This contribution shows an application of Markov chains in digitalcommunication. A random sequence of symbols 0 and 1 is analyzedby a state machine. The state machine switches to state "0" after detecting an unbroken sequence of $\omega$ zero symbols ($\omega$ being a fixed integer),and to state "1" after detecting an unbroken sequence of $\omega$ones. The task to nd the probabilities of each of these two states after$n$ time steps leads to a Markov chain. We show the construction of thetransition matrix and determine the steady-state probabilities for thetime-homogeneous case.
@article{327,
title = {An application of Markov chains in digital communication},
journal = {Tatra Mountains Mathematical Publications},
volume = {62},
year = {2015},
doi = {10.2478/tatra.v63i0.327},
language = {EN},
url = {http://dml.mathdoc.fr/item/327}
}
Hlavičková, Irena. An application of Markov chains in digital communication. Tatra Mountains Mathematical Publications, Tome 62 (2015) . doi : 10.2478/tatra.v63i0.327. http://gdmltest.u-ga.fr/item/327/