A class of finitary codes
From MaRDI portal
From the authors' summary: It is shown that for any two Bernoulli schemes with a finite number of states and unequal entropies, there exists a finitary homomorphism from the scheme with larger entropy to the one with smaller entropy.
Recommendations
Cites work
- A family of codes between some Markov and Bernoulli schemes
- scientific article; zbMATH DE number 3161570 (Why is no real title available?)
- scientific article; zbMATH DE number 3463931 (Why is no real title available?)
- scientific article; zbMATH DE number 3526984 (Why is no real title available?)
- On the isomorphism problem for Bernoulli schemes
- Representation of systems of measurable sets
Cited in
(42)- Finitary isomorphisms of irreducible Markov shifts
- Almost topological dynamical systems
- Finitary coding for the one-dimensional \(T,T^{-1}\) process with drift.
- On the existence and nonexistence of finitary codings for a class of random fields
- Lucio Russo: probability theory and current interests
- Code length between Markov processes
- The orbital equivalence of Bernoulli actions and their Sinai factors
- Finitary isomorphisms of renewal point processes and continuous-time regenerative processes
- Finitary isomorphisms of Poisson point processes
- Finitary isomorphisms of some infinite entropy Bernoulli flows
- Monotone factors of i.i.d. processes
- Irrational rotation of the circle and the binary odometer are finitarily orbit equivalent
- Some remarks on output measures
- Any two irreducible Markov chains are finitarily orbit equivalent
- A monotone Sinai theorem
- Ergodic universality of some topological dynamical systems
- An invariant of finitary codes with finite expected square root coding length
- Deux sch�mas de bernoulli d'alphabet d�nombrable et d'entropie infinie sont finitairement isomorphes
- scientific article; zbMATH DE number 3863086 (Why is no real title available?)
- Universal finitary codes with exponential tails
- PERFECTION IN R-PROCESSES
- Finitary codes between Markov processes
- The finitary isomorphism theorem for Markov shifts
- Finitary coding of Markov random fields
- scientific article; zbMATH DE number 1296966 (Why is no real title available?)
- Ergodic description of STIT tessellations
- Some factors of nonsingular Bernoulli shifts
- Equivariant thinning over a free group
- A monotone isomorphism theorem
- scientific article; zbMATH DE number 6453254 (Why is no real title available?)
- Finitary Codes, a short survey
- Universally measure-preserving homeomorphisms of Cantor minimal systems
- Random interlacement is a factor of i.i.d.
- Isomorphisms of Poisson systems over locally compact groups
- Poisson splitting by factors
- Sinai factors of nonsingular systems: Bernoulli shifts and Anosov flows
- The finitary coding of two Bernoulli schemes with unequal entropies has finite expectation
- Finitary isomorphisms of Brownian motions
- Finitely dependent processes are finitary
- Finitary codings for spatial mixing Markov random fields
- Any two irreducible Markov chains of equal entropy are finitarily Kakutani equivalent
- Finitary isomorphism of some renewal processes to Bernoulli schemes
This page was built for publication: A class of finitary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1239131)
