IMPROVED REDUNDANCY OF A VERSION OF THE LEMPEL-ZIV ALGORITHM

被引：28

作者：

WYNER, AD ^{[1
]}

WYNER, AJ ^{[1
]}

机构：

[1] STANFORD UNIV,DEPT STAT,STANFORD,CA 94305

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1995年 / 41卷 / 03期

关键词：

DATA COMPRESSION; LEMPEL-ZIV CODING;

D O I：

10.1109/18.382018

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The Lempel-Ziv data compression algorithm has the property that for finite-memory sources the redundancy rho n (defined as the difference between the average code rate and the entropy when the memory size is n) is O(loglogn/logn). We suggest a new version of the algorithm with redundancy rho n = O(1/logn).

引用

页码：723 / 731

页数：9

共 4 条

[1]

Bender P.E., Wolf J.K., New asymptotic bounds and improvements on the Lempel—Ziv data compression algorithm, IEEE Trans. Inform. Theory, 37, pp. 721-729, (1991)

[2]

Feller W., An Introduction to Probability Theory and Its Applications, (1957)

[3]

Wyner A.D., Ziv J., Some asymptotic properties of the entropy of a stationary ergodic source with applications to data compression, IEEE Trans. Inform. Theory, 35, pp. 1250-1258, (1989)

[4]

Wyner A.J., String matching theorems and applications to data compression and statistics, (1993)

← 1 →