An algorithm for universal lossless compression with side information
An algorithm for universal lossless compression with side information
复制标题
DOI：
10.1109/tit.2006.880020
复制
发表时间：
2006-09-01
影响因子：
2.5
通讯作者：
Verdu, Sergio
中科院分区：
文献类型：
--
作者：
Cai, Haixiao;Kulkarni, Sanjeev R.;Verdu, Sergio
本文提出了一种基于上下文树加权（CTW）方法的有限字母序列x（1）（n）的通用压缩算法，该算法的边信息y（1）（n）对编码器和解码器都是可用的。我们证明了概率1的压缩比收敛到条件熵率联合平稳遍历源。马尔可夫链和英文文本的实验结果表明了该算法的有效性。
This paper proposes a new algorithm based on the Context-Tree Weighting (CTW) method for universal compression of a finite-alphabet sequence x(1)(n) with side information y(1)(n) available to both the encoder and decoder. We prove that with probability one the compression ratio converges to the conditional entropy rate for jointly stationary ergodic sources. Experimental results with Markov chains and English texts show the effectiveness of the algorithm.