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

被引:7
作者
Debowski, Lukasz [1 ]
机构
[1] Ctr Wiskunde & Informat, NL-1098 XG Amsterdam, Netherlands
关键词
Asymptotically mean stationary processes; Variable-length coding; Synchronization; Shift-invariant algebras; Complete fix-free sets; Finite-energy processes; Block entropy;
D O I
10.1007/s10959-009-0264-0
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
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 shift-invariant sigma-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.
引用
收藏
页码:237 / 256
页数:20
相关论文
共 28 条
  • [1] Ahlswede R., 1996, 1st Intas Seminar on Coding Theory and Combinatorics, Thahkadzor, Armenia, P20
  • [2] AHLSWEDE R, 2005, ELECT NOTES DISCRETE, V21, P119
  • [3] Allouche J.P., 2003, Automatic sequences: Theory, applications, generalizations
  • [4] [Anonymous], 2007, Variable-length codes for data compression
  • [5] Bajic D, 2005, 2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, P19
  • [6] THE STRONG ERGODIC THEOREM FOR DENSITIES - GENERALIZED SHANNON-MCMILLAN-BREIMAN THEOREM
    BARRON, AR
    [J]. ANNALS OF PROBABILITY, 1985, 13 (04) : 1292 - 1303
  • [7] ON THE CONSTRUCTION OF STATISTICALLY SYNCHRONIZABLE CODES
    CAPOCELLI, RM
    DESANTIS, AA
    GARGANO, L
    VACCARO, U
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (02) : 407 - 414
  • [8] STATIONARY SYMBOL SEQUENCES FROM VARIABLE-LENGTH WORD SEQUENCES
    CARIOLARO, GL
    PIEROBON, GL
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (02) : 243 - 253
  • [9] The smallest grammar problem
    Charikar, M
    Lehman, E
    Liu, D
    Panigrahy, R
    Prabhakaran, M
    Sahai, A
    Shelat, A
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (07) : 2554 - 2576
  • [10] Cover T.M., 2006, ELEMENTS INFORM THEO, V2nd ed