On the performance of recency-rank and block-sorting universal lossless data compression algorithms
Tóm tắt
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.
Từ khóa
#Source coding #Redundancy #SequencesTài liệu tham khảo
10.1007/978-1-4757-2024-2
10.1109/18.179344
ryabko, 1980, book stack data compression, Probl Pered Inform, 16, 16
shields, 1996, The Ergodic Theory of Discrete Sample Paths
10.1109/18.42176
10.1109/18.45281
10.1109/TIT.1978.1055934
burrows, 1994, A block-sorting lossless data compression algorithm
arimura, 1998, almost sure convergence coding theorem for block sorting data compression algorithm, Proc Int Symp Information Theory and Its Applications (ISITA98)
10.1109/DCC.1999.755667
10.1145/5684.5688
10.1109/TIT.1987.1057251
10.1109/TIT.1975.1055349
arimura, 1998, asymptotic optimality of the block sorting data compression algorithm, IEICE Trans Fundamentals, e81 a, 2117
10.1007/978-1-4757-3982-4
arimura, 1999, Information theoretic analysis of block sorting data compression method