On the finitary isomorphisms of markov shifts that have finite expected coding time
A necessary condition is given for a finitary isomorphism between mixing Markov shifts of equal entropy to have finite expected coding time.
Saved in:
| Main Author: | |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
12 September 2013
|
| In: |
Probability theory and related fields
Year: 1983, Volume: 65, Issue: 2, Pages: 323-328 |
| ISSN: | 1432-2064 |
| DOI: | 10.1007/BF00532486 |
| Online Access: | Resolving-System, Volltext: http://dx.doi.org/10.1007/BF00532486 Verlag, Volltext: https://link.springer.com/article/10.1007/BF00532486 
|
| Author Notes: | Wolfgang Krieger |
| Summary: | A necessary condition is given for a finitary isomorphism between mixing Markov shifts of equal entropy to have finite expected coding time. |
|---|---|
| Item Description: | First online: 12 September 2013 Gesehen am 10.08.2018 |
| Physical Description: | Online Resource |
| ISSN: | 1432-2064 |
| DOI: | 10.1007/BF00532486 |