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

Abstract

Let p and q be probability vectors with the same entropy h. Denote by B(p) the Bernoulli shift indexed by with marginal distribution p. Suppose that φ is a measure preserving homomorphism from B(p) to B(q). We prove that if the coding length of φ has a finite 1/2 moment, then σp2=σq2, where σp2=Σi pi(- pi-h)2 is the informational variance of p. 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, we exhibit probability vectors p and q that are not permutations of each other, such that there exists a finitary isomorphism from B(p) to B(q) where the coding lengths of and of its inverse have a finite θ moment. We also present an extension to ergodic Markov chains.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…