English

An invariant of finitary codes with finite expected square root coding length

Probability 2007-07-13 v1 Information Theory math.IT

Abstract

Let pp and qq be probability vectors with the same entropy hh. Denote by B(p)B(p) the Bernoulli shift indexed by Z\Z with marginal distribution pp. Suppose that ϕ\phi is a measure preserving homomorphism from B(p)B(p) to B(q)B(q). We prove that if the coding length of ϕ\phi has a finite 1/2 moment, then σp2=σq2\sigma_p^2=\sigma_q^2, where σp2=ipi(logpih)2\sigma_p^2=\sum_i p_i(-\log p_i-h)^2 is the {\dof informational variance} of pp. In this result, which sharpens a theorem of Parry (1979), the 1/2 moment cannot be replaced by a lower moment. On the other hand, for any θ<1\theta<1, we exhibit probability vectors pp and qq that are not permutations of each other, such that there exists a finitary isomorphism Φ\Phi from B(p)B(p) to B(q)B(q) where the coding lengths of Φ\Phi and of its inverse have a finite θ\theta moment. We also present an extension to ergodic Markov chains.

Cite

@article{arxiv.math/0309120,
  title  = {An invariant of finitary codes with finite expected square root coding length},
  author = {Nate Harvey and Yuval Peres},
  journal= {arXiv preprint arXiv:math/0309120},
  year   = {2007}
}

Comments

18 pages

R2 v1 2026-07-22T16:57:29.535Z