FIXED DATA-BASE VERSION OF THE LEMPEL-ZIV DATA-COMPRESSION ALGORITHM

被引：35

作者：

WYNER, AD ^{[1
]}

ZIV, J ^{[1
]}

机构：

[1] TECHNION ISRAEL INST TECHNOL,FAC ELECT ENGN,IL-32000 HAIFA,ISRAEL

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1991年 / 37卷 / 03期

关键词：

data compression; fixed database; Lempel-Ziv;

D O I：

10.1109/18.79955

中图分类号：

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

学科分类号：

0812 ;

摘要：

It is demonstrated that a variant of the Lempel-Ziv data compression algorithm where the data base is held fixed and is reused to encode successive strings of incoming input symbols is optimal, provided that the source is stationary and satisfies certain conditions (e.g., a finite-order Markov source).

引用

页码：878 / 890

页数：13

共 3 条

[1] LINEAR ALGORITHM FOR DATA-COMPRESSION VIA STRING MATCHING [J].

RODEH, M ;

PRATT, VR ;

EVEN, S .

JOURNAL OF THE ACM, 1981, 28 (01) :16-24

[2] SOME ASYMPTOTIC PROPERTIES OF THE ENTROPY OF A STATIONARY ERGODIC DATA SOURCE WITH APPLICATIONS TO DATA-COMPRESSION [J].

WYNER, AD ;

ZIV, J .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (06) :1250-1258

[3] COMPRESSION OF INDIVIDUAL SEQUENCES VIA VARIABLE-RATE CODING [J].

ZIV, J ;

LEMPEL, A .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (05) :530-536

← 1 →