A universal algorithm for sequential data compression

A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainabl...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 23; no. 3; pp. 337 - 343
Main Authors: Ziv, J., Lempel, A.
Format: Journal Article
Language:English
Published: IEEE 01.05.1977
Subjects:
Codes
Compression algorithms
Data compression
Decoding
Encoding
Feeds
Lower bound
Silicon
Symbols
Upper bound
ISSN:0018-9448, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainable by block-to-variable codes and variable-to-block codes designed to match a completely specified source.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.1977.1055714