Advertisement

Coding for Discrete Markov Sources

  • Giuseppe Longo
Part of the International Centre for Mechanical Sciences book series (CISM, volume 110)

Abstract

Consider a finite Markov chain φ having K states \({J_1},{J_2}, \ldots ,{J_k}\) and defined by the initial probability distribution
$${\Pi _0} = {\left[ {{P_1} \cdots {P_k}} \right]^{\left. + \right)}}$$
(3.1)
and by the transition probability matrix
$$\Pi = \left[ {\begin{array}{*{20}{c}} {{{\text{P}}_{{\text{11}}}}{{\text{P}}_{{\text{12}}}} \cdots {{\text{P}}_{{\text{1k}}}}} \\ {{{\text{p}}_{{\text{k1}}}}{{\text{p}}_{{\text{k}}2}} \cdots {{\text{p}}_{{\text{kk}}}}} \end{array}} \right].$$
(3.2)

Keywords

Typical Sequence Stochastic Matrix Will Emit Auxiliary Lemma Initial Letter 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Wien 1971

Authors and Affiliations

  • Giuseppe Longo
    • 1
  1. 1.University of TriesteItaly

Personalised recommendations