Title :
On the performance of recency-rank and block-sorting universal lossless data compression algorithms
Author_Institution :
NTT Commun. Sci. Labs., NTT Corp., Kyoto, Japan
fDate :
9/1/2002 12:00:00 AM
Abstract :
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
Keywords :
redundancy; sequences; source coding; Burrows-Wheeler transform; asymptotically mean stationary sources; block-sorting universal lossless data compression algorithms; book-stack algorithm; finite-length sequences; infinite-length sequences; move-to-front algorithm; recency-rank universal lossless data compression algorithms; redundancy; stationary ergodic sources; universal code; Algorithm design and analysis; Art; Binary sequences; Costs; Data compression; Entropy; Notice of Violation; Performance loss; Sorting;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2002.801477
