UNIVERSAL ALGORITHM FOR SEQUENTIAL DATA COMPRESSION

被引：2905

作者：

ZIV, J ^{[1
]}

LEMPEL, A ^{[1
]}

机构：

[1] TECHNION ISRAEL INST TECHNOL, DEPT ELECT ENGN, HAIFA, ISRAEL

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1977年 / 23卷 / 03期

关键词：

D O I：

10.1109/TIT.1977.1055714

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：337 / 343

页数：7

共 11 条

[1] UNIVERSAL NOISELESS CODING [J].

DAVISSON, LD .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (06) :783-795

[2]

Fitingof B. M., 1966, PROBLEMY PEREDACHI I, P3

[3]

GALLAGER RG, 1968, INFORMATION THEORY R

[4] A METHOD FOR THE CONSTRUCTION OF MINIMUM-REDUNDANCY CODES [J].

HUFFMAN, DA .

PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1952, 40 (09) :1098-1101

[5] VARIABLE-LENGTH-TO-BLOCK CODING [J].

JELINEK, F ;

SCHNEIDER, KS .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1972, 18 (06) :765-+

[6] MINIMUM-REDUNDANCY CODING FOR DISCRETE NOISELESS CHANNEL [J].

KARP, RM .

IRE TRANSACTIONS ON INFORMATION THEORY, 1961, 7 (01) :27-&

[7] COMPLEXITY OF FINITE SEQUENCES [J].

LEMPEL, A ;

ZIV, J .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (01) :75-81

[8] ALGORITHM FOR OPTIMAL PREFIX PARSING OF A NOISELESS AND MEMORYLESS CHANNEL [J].

LEMPEL, A ;

EVEN, S ;

COHN, M .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (02) :208-214

[9] EFFICIENT GENERATION OF OPTIMAL PREFIX CODE - EQUIPROBABLE WORDS USING UNEQUAL COST LETTERS [J].

PERL, Y ;

GAREY, MR ;

EVEN, S .

JOURNAL OF THE ACM, 1975, 22 (02) :202-214

[10] OPTIMAL VARIABLE LENGTH CODES (ARBITRARY SYMBOL COST AND EQUAL CODE WORD PROBABILITY) [J].

VARN, B .

INFORMATION AND CONTROL, 1971, 19 (04) :289-&

← 1 2 →