An application of Markov chains in digital communication

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F15%3APU117270" target="_blank" >RIV/00216305:26220/15:PU117270 - isvavai.cz</a>
Result on the web
<a href="http://tatra.mat.savba.sk" target="_blank" >http://tatra.mat.savba.sk</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1515/tmmp-2015-0025" target="_blank" >10.1515/tmmp-2015-0025</a>

Result language
angličtina
Original language name
An application of Markov chains in digital communication
Original language description
This contribution shows an application of Markov chains in digital communication. A random sequence of 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.
Czech name
—
Czech description
—

Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/GAP201%2F10%2F1032" target="_blank" >GAP201/10/1032: Difference equations and dynamic equations on time scales III</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)