Publication detail

An application of Markov chains in digital communication

HLAVIČKOVÁ, I.

Original Title

An application of Markov chains in digital communication

Type

journal article in Scopus

Language

English

Original 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

Authors

HLAVIČKOVÁ, I.

RIV year

2015

Released

1. 9. 2015

Publisher

Mathematical Institute, Slovak Academy of Sciences

Location

Bratislava

ISBN

1210-3195

Periodical

Tatra Mountains Mathematical Publications

Number

63

State

Czech Republic

Pages from

129

Pages to

137

Pages count

9

URL

http://tatra.mat.savba.sk

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"
}