Universal finitary codes with exponential tails

DOI10.1112/plms/pdl018zbMath1148.37004arXivmath/0502484MaRDI 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

zbMATH Keywords

Bernoulli process; finitary codes; finitary homomorphism

Mathematics Subject Classification ID

28D20: Entropy and other invariants

37A50: Dynamical systems and their relations with probability theory and stochastic processes

37B10: Symbolic dynamics

94B99: Theory of error-correcting codes and error-detecting codes

60G55: Point processes (e.g., Poisson, Cox, Hawkes processes)

Related Items

Markov chains with exponential return times are finitary, A monotone Sinai theorem, Finitary isomorphisms of Brownian motions, Finitely dependent processes are finitary, Finitary codings for spatial mixing Markov random fields, Finitary coding for the sub-critical Ising model with finite expected coding volume, Finitary isomorphisms of Poisson point processes

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