Code length between Markov processes

DOI10.1007/BF02810676zbMath0943.37007MaRDI QIDQ1806254

Jacek Serafin, Anzelm Iwanik

Publication date: 12 February 2000

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

entropyMarkov processentropiescode lengthfinite expectation\(L^p\) functionfinitary codemixing Markov processesmixing Markov shifts

Mathematics Subject Classification ID

Entropy and other invariants (28D20) Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Ergodic theorems, spectral theory, Markov operators (37A30) Topological entropy (37B40) Markov processes (60J99)

Related Items (2)

Some remarks on output measures ⋮ Universal finitary codes with exponential tails

Cites Work

• The finitary coding of two Bernoulli schemes with unequal entropies has finite expectation
• A class of finitary codes
• Finitary codes between Markov processes
• Unnamed Item
• Unnamed Item

This page was built for publication: Code length between Markov processes