Title :
On the performance of recency-rank and block-sorting universal lossless data compression algorithms
Author_Institution :
NTT Commun. Sci. Labs., Kyoto, Japan
Abstract :
We present bounds of the redundancy of the recency-rank and the block-sorting universal lossless data compression algorithms for finite-length sequences
Keywords :
codes; data compression; sequences; block-sorting data compression algorithms; finite-length sequences; lossless code; lossless data compression algorithms; recency-rank data compression algorithms; Data compression; Decoding; Entropy; Laboratories; Performance loss; Sorting; Source coding;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866625
