Facebook Instagram Twitter RSS Feed PodBean Back to top on side

An application of Markov chains in digital communication

In: Tatra Mountains Mathematical Publications, vol. 63, no. 2
Irena Hlavičková
Detaily:
Rok, strany: 2015, 129 - 137
Kľúčové slová:
difference equation, Markov chains
O článku:
This contribution shows an application of Markov chains in digital communication. A random sequence of the symbols $0$ and $1$ is analyzed by a state machine. The state machine switches to state ``0'' after detecting an unbroken sequence of $w$ zero symbols ($w$ being a fixed integer), and to state ``1'' after detecting an unbroken sequence of $w$ ones. The task to find the probabilities of each of these two states after $n$ time steps leads to a Markov chain. We show the construction of the transition matrix and determine the steady-state probabilities for the time-homogeneous case.
Ako citovať:
ISO 690:
Hlavičková, I. 2015. An application of Markov chains in digital communication. In Tatra Mountains Mathematical Publications, vol. 63, no.2, pp. 129-137. 1210-3195.

APA:
Hlavičková, I. (2015). An application of Markov chains in digital communication. Tatra Mountains Mathematical Publications, 63(2), 129-137. 1210-3195.