Universal finitary codes with exponential tails
From MaRDI portal
Publication:3434058
DOI10.1112/plms/pdl018zbMath1148.37004arXivmath/0502484OpenAlexW2115926180MaRDI QIDQ3434058
Yuval Peres, Alexander E. Holroyd, Nate Harvey, Dan Romik
Publication date: 23 April 2007
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0502484
Entropy and other invariants (28D20) Dynamical systems and their relations with probability theory and stochastic processes (37A50) Symbolic dynamics (37B10) Theory of error-correcting codes and error-detecting codes (94B99) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)
Related Items (7)
A monotone Sinai theorem ⋮ Finitary coding for the sub-critical Ising model with finite expected coding volume ⋮ Finitary isomorphisms of Poisson point processes ⋮ Markov chains with exponential return times are finitary ⋮ Finitary isomorphisms of Brownian motions ⋮ Finitely dependent processes are finitary ⋮ Finitary codings for spatial mixing Markov random fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The finitary coding of two Bernoulli schemes with unequal entropies has finite expectation
- Explicit codes for some infinite entropy Bernoulli shifts
- Iterating von Neumann's procedure for extracting random bits
- A class of finitary codes
- Bernoulli schemes of the same entropy are finitarily isomorphic
- Code length between Markov processes
- Sharp entropy bounds for discrete statistical simulation
- Interval algorithm for random number generation
- The Efficient Construction of an Unbiased Random Sequence
This page was built for publication: Universal finitary codes with exponential tails