Finitary Isomorphisms with Finite Expected Code Lengths

DOI10.1112/BLMS/11.2.170zbMath0425.60029OpenAlexW2059178506MaRDI QIDQ3860565

William Parry

Publication date: 1979

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/blms/11.2.170

zbMATH Keywords

finitary automorphismscode-lengthfinitary isomorphisms between two countable state stationary processes

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Information theory (general) (94A15)

Related Items (14)

Hyperbolic structure preserving isomorphisms of Markov shifts. II ⋮ Unnamed Item ⋮ Conditional pressure and coding ⋮ A note on r-processes ⋮ The mathematical research of William Parry FRS ⋮ An invariant of finitary codes with finite expected square root coding length ⋮ Hyperbolic structure preserving isomorphisms of Markov shifts ⋮ PERFECTION IN R-PROCESSES ⋮ Spanning tree invariants, loop systems and doubly stochastic matrices ⋮ On the finitary isomorphisms of markov shifts that have finite expected coding time ⋮ Unnamed Item ⋮ Natural coefficients and invariants for Markov-shifts ⋮ Invariants for finitary isomorphisms with finite expected code lengths ⋮ Constructing finitary isomorphisms with finite expected coding times

This page was built for publication: Finitary Isomorphisms with Finite Expected Code Lengths