Invariants for finitary isomorphisms with finite expected code lengths
From MaRDI portal
Publication:1057381
DOI10.1007/BF01388489zbMath0563.28009OpenAlexW2024538061MaRDI QIDQ1057381
Publication date: 1984
Published in: Inventiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/143114
Markov shiftsBernoulli shiftsbeta-functioninvariant of codes with finite expected code length and inverse code length
Related Items (17)
Hyperbolic structure preserving isomorphisms of Markov shifts. II ⋮ Bounds in polynomial rings over Artinian local rings ⋮ An information cocycle for groups of non-singular transformations ⋮ The mathematical research of William Parry FRS ⋮ On automorphisms of von Neumann algebras constructed by measure space transformations. II ⋮ Markov measures determine the zeta function ⋮ On Automorphisms of Markov Chains ⋮ The weight-per-symbol polytope and scaffolds of invariants associated with Markov chains ⋮ An invariant of finitary codes with finite expected square root coding length ⋮ Matrices of Polynomials, Positivity, and Finite Equivalence of Markov Chains ⋮ Almost isomorphism for countable state Markov shifts ⋮ Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees ⋮ Hyperbolic structure preserving isomorphisms of Markov shifts ⋮ Finitary codings for spatial mixing Markov random fields ⋮ Powers of positive polynomials and codings of Markov chains onto Bernoulli shifts ⋮ Unnamed Item ⋮ Constructing finitary isomorphisms with finite expected coding times
Cites Work
This page was built for publication: Invariants for finitary isomorphisms with finite expected code lengths
