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

نویسندگان

  • Nate Harvey
  • Yuval Peres
چکیده

Let p and q be probability vectors with the same entropy h. Denote by B(p) the Bernoulli shift indexed by Z 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 σ2 p = σ 2 q , where σ 2 p = ∑ i pi(− log pi − h)2 is the informational variance of p. In this result, 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.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal finitary codes with exponential tails

In 1977, Keane and Smorodinsky [9] showed that there exists a finitary homomorphism from any finite-alphabet Bernoulli process to any other finite-alphabet Bernoulli process of strictly lower entropy. In 1996, Serafin [17] proved the existence of a finitary homomorphism with finite expected coding length. In this paper, we construct such a homomorphism in which the coding length has exponential...

متن کامل

Fast Polarization for Processes with Memory

Fast polarization is crucial for the performance guarantees of polar codes. In the memoryless setting, the rate of polarization is known to be exponential in the square root of the block length. A complete characterization of the rate of polarization for models with memory has been missing. We consider polar codes for processes with memory that are characterized by an underlying ergodic finite ...

متن کامل

An efficient secure channel coding scheme based on polar codes

In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...

متن کامل

Finitary Coding of the Sub-critical Ising Model with Finite Expected Coding Volume

It has been shown by van den Berg and Steif [3] that the sub-critical Ising model on Z is a finitary factor of a finite-valued i.i.d. process. We strengthen this by showing that the factor map can be made to have finite expected coding volume (in fact, stretched-exponential tails), answering a question of van den Berg and Steif [3]. The result holds at any temperature above the critical tempera...

متن کامل

Perfect simulation and finitary coding for multicolor systems with interactions of infinite range

We consider a particle system on Z with finite state space and interactions of infinite range. Assuming that the rate of change is continuous and decays sufficiently fast, we introduce a perfect simulation algorithm for the stationary process. The basic tool we use is a representation of the infinite range change rates as a mixture of finite range change rates. The perfect simulation scheme pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003