Variable-Length Coding of Two-Sided Asymptotically Mean Stationary Measures

We collect several observations that concern variable-length coding of two-sided infinite sequences in a probabilistic setting. Attention is paid to images and preimages of asymptotically mean stationary measures defined on subsets of these sequences. We point out sufficient conditions under which the variable length coding and its inverse preserve asymptotic mean stationarity. Moreover, conditions for preservation of shiftinvariant σ-fields and the finite-energy property are discussed, and the block entropies for stationary means of coded processes are related in some cases. Subsequently, we apply certain of these results to construct a stationary nonergodic process with a desired linguistic interpretation.

[1]  Alfredo De Santis,et al.  On the construction of statistically synchronizable codes , 1992, IEEE Trans. Inf. Theory.

[2]  Rudolf Ahlswede,et al.  Some properties of fix-free codes , 1996 .

[3]  Ronald L. Rivest,et al.  Complete variable-length “fix-free” codes , 1995, Des. Codes Cryptogr..

[4]  R. Gray,et al.  Asymptotically Mean Stationary Measures , 1980 .

[5]  Adam Elga,et al.  Self‐locating belief and the Sleeping Beauty problem , 2000 .

[6]  R. Timo,et al.  On the entropy rate of word-valued sources , 2007, 2007 Australasian Telecommunication Networks and Applications Conference.

[7]  O. W. Rechard.  Invariant measures for many-one transformations , 1956 .

[8]  P. Shields.  The Ergodic Theory of Discrete Sample Paths , 1996 .

[9]  Rudolf Ahlswede,et al.  T-shift synchronization codes , 2008, Discret. Appl. Math..

[10]  En-Hui Yang,et al.  Grammar-based codes: A new class of universal lossless source codes , 2000, IEEE Trans. Inf. Theory.

[11]  Lukasz Debowski,et al.  On the Vocabulary of Grammar-Based Codes and the Logical Consistency of Texts , 2008, IEEE Transactions on Information Theory.

[12]  Abhi Shelat,et al.  The smallest grammar problem , 2005, IEEE Transactions on Information Theory.

[13]  J. Shallit,et al.  Automatic Sequences: Frequency of Letters , 2003 .

[14]  Robert M. Gray,et al.  Asymptotically mean stationary channels , 1981, IEEE Trans. Inf. Theory.

[15]  Dejan Vukobratovic,et al.  Search process and probabilistic bifix approach , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[16]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[17]  O. Kallenberg.  Foundations of Modern Probability , 2021, Probability Theory and Stochastic Modelling.

[18]  P. Shields.  String matching bounds via coding , 1997 .

[19]  Lukasz Debowski,et al.  A general definition of conditional information and its application to ergodic decomposition , 2009 .

[20]  J. J. Stiffler,et al.  Theory of synchronous communications , 1971 .

[21]  Gianfranco Cariolaro,et al.  Stationary symbol sequences from variable-length word sequences , 1977, IEEE Trans. Inf. Theory.

[22]  Harry L. Hurd,et al.  Stationarizing Properties of Random Shifts , 1974 .

[23]  A. Barron.  THE STRONG ERGODIC THEOREM FOR DENSITIES: GENERALIZED SHANNON-MCMILLAN-BREIMAN THEOREM' , 1985 .