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

We present bounds of the redundancy of the recency-rank and the block-sorting universal lossless data compression algorithms for finite-length sequences.

Saved in:
Bibliographic Details
Published in:Information Theory: 2000 IEEE International Symposium On p. 327
Main Author: Muramatsu, J.
Format: Conference Proceeding
Language:English
Published: IEEE 2000
Subjects:
Data compression
Decoding
Entropy
Laboratories
Performance loss
Sorting
Source coding
ISBN:9780780358577, 0780358570
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present bounds of the redundancy of the recency-rank and the block-sorting universal lossless data compression algorithms for finite-length sequences.
ISBN:9780780358577
0780358570
DOI:10.1109/ISIT.2000.866625