论文信息 - On Sliding-Window Universal Data Compression with Limited Memory

On Sliding-Window Universal Data Compression with Limited Memory

Nonasymptotic coding and converse theorems are derived for universal data compression algorithms in cases where the training sequence ("history") that is available to the encoder consists of the most recent segment of the input data string that has been processed, but is not large enough so as to yield the ultimate compression, namely, the entropy of the source.

Jacob Ziv | Yehuda Hershkovits

[1] Aaron D. Wyner,et al. Classification with finite memory , 1996, IEEE Trans. Inf. Theory.

[2] N. J. A. Sloane,et al. Lower bounds for constant weight codes , 1980, IEEE Trans. Inf. Theory.

[3] Lee D. Davisson,et al. Universal noiseless coding , 1973, IEEE Trans. Inf. Theory.

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

[5] M. Kac. On the notion of recurrence in discrete stochastic processes , 1947 .

[6] Aaron D. Wyner,et al. Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression , 1989, IEEE Trans. Inf. Theory.

[7] Frans M. J. Willems,et al. Universal data compression and repetition times , 1989, IEEE Trans. Inf. Theory.

[8] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[9] Lee D. Davisson,et al. Minimax noiseless universal coding for Markov sources , 1983, IEEE Trans. Inf. Theory.

[10] Jacob Ziv,et al. On fixed-database universal data compression with limited memory , 1997, IEEE Trans. Inf. Theory.

[11] Aaron D. Wyner,et al. Fixed data base version of the Lempel-Ziv data compression algorithm , 1991, IEEE Trans. Inf. Theory.

[12] A. D. Wyner,et al. The sliding-window Lempel-Ziv algorithm is asymptotically optimal , 1994, Proc. IEEE.

[13] R. Gallager. Information Theory and Reliable Communication , 1968 .