论文信息 - On the performance of recency-rank and block-sorting universal lossless data compression algorithms

On the performance of recency-rank and block-sorting universal lossless data compression algorithms

Bounds on the redundancy of the recency-rank and block-sorting universal lossless data compression algorithms for finite-length sequences are presented. These algorithms are asymptotically optimal for infinite-length sequences, stationary ergodic sources in the almost-sure sense, and asymptotically mean stationary sources in the average and almost-sure sense.

Jun Muramatsu

[1] Benjamin Weiss,et al. Entropy and data compression schemes , 1993, IEEE Trans. Inf. Theory.

[2] Abraham Lempel,et al. Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[3] Michelle Effros,et al. Universal lossless source coding with the Burrows Wheeler transform , 1999, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096).

[4] Robert E. Tarjan,et al. A Locally Adaptive Data , 1986 .

[5] Peter Elias,et al. Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.

[6] R. Gray. Entropy and Information Theory , 1990, Springer New York.

[7] 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.

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

[9] Peter Elias,et al. Interval and recency rank source coding: Two on-line adaptive variable-length schemes , 1987, IEEE Trans. Inf. Theory.

[10] Hirosuke Yamamoto,et al. Asymptotic Optimality of the Block Sorting Data Compression Algorithm (Special Section on Information Theory and Its Applications) , 1998 .

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

[12] D. J. Wheeler,et al. A Block-sorting Lossless Data Compression Algorithm , 1994 .