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

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 48; no. 9; pp. 2621 - 2625
Main Author: Muramatsu, J.
Format: Journal Article
Language:English
Published: New York IEEE 01.09.2002
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Codes
Data compression
Redundancy
Sequences
Source coding
ISSN:0018-9448, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2002.801477