Result Details

An application of Markov chains in digital communication

HLAVIČKOVÁ, I. An application of Markov chains in digital communication. Tatra Mountains Mathematical Publications, 2015, no. 63, p. 129-137. ISSN: 1210-3195.
Type
journal article
Language
English
Authors
Abstract

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.

Keywords

difference equations; Markov chains

URL
Published
2015
Pages
129–137
Journal
Tatra Mountains Mathematical Publications, no. 63, ISSN 1210-3195
Publisher
Mathematical Institute, Slovak Academy of Sciences
Place
Bratislava
DOI
EID Scopus
BibTeX
@article{BUT120395,
  author="Irena {Hlavičková}",
  title="An application of Markov chains in digital communication",
  journal="Tatra Mountains Mathematical Publications",
  year="2015",
  number="63",
  pages="129--137",
  doi="10.1515/tmmp-2015-0025",
  issn="1210-3195",
  url="http://tatra.mat.savba.sk"
}
Departments
Back to top