论文信息 - Asymptotic Redundancy of the MTF Scheme for - 字舞流文

Asymptotic Redundancy of the MTF Scheme for

Hirosuke Yamamoto | Mitsuharu Arimura | Hirosuke Yamamoto | Mitsuharu Arimura | M. Arimura

[1] J. Muramatsu,et al. On the performance of recency-rank and block-sorting universal lossless data compression algorithms , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

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

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

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

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

[6] Toby Berger,et al. Review of Information Theory: Coding Theorems for Discrete Memoryless Systems (Csiszár, I., and Körner, J.; 1981) , 1984, IEEE Trans. Inf. Theory.

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

[8] 韓太舜,et al. Mathematics of information and coding , 2002 .

[9] James Allen Fill,et al. An exact formula for the move-to-front rule for self-organizing lists , 1996 .

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