Journal Article

A Universal Algorithm for Sequential Data Compression

IEEE Transactions on Information Theory (1977) 23(3) 337-343
DOI: 10.1109/TIT.1977.1055714
4.1kCitations
Citations of this article
751Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 1977, IEEE. All rights reserved.

Cite

CITATION STYLE

APA

Ziv, J., & Lempel, A. (1977). A Universal Algorithm for Sequential Data Compression. IEEE Transactions on Information Theory, 23(3), 337–343. https://doi.org/10.1109/TIT.1977.1055714

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free