Detail publikace

An application of Markov chains in digital communication

HLAVIČKOVÁ, I.

Originální název

An application of Markov chains in digital communication

Typ

článek v časopise ve Scopus, Jsc

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

difference equations; Markov chains

Autoři

HLAVIČKOVÁ, I.

Rok RIV

2015

Vydáno

1. 9. 2015

Nakladatel

Mathematical Institute, Slovak Academy of Sciences

Místo

Bratislava

ISSN

1210-3195

Periodikum

Tatra Mountains Mathematical Publications

Číslo

63

Stát

Česká republika

Strany od

129

Strany do

137

Strany počet

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