IS HUFFMAN CODING DEAD

被引：26

作者：

BOOKSTEIN, A ^{[1
]}

KLEIN, ST ^{[1
]}

机构：

[1] BAR ILAN UNIV,DEPT MATH & COMP SCI,IL-52900 RAMAT GAN,ISRAEL

来源：

COMPUTING | 1993年 / 50卷 / 04期

关键词：

DATA COMPRESSION; HUFFMAN CODES; ARITHMETIC CODES; COOLING THEORY; INFORMATION STORAGE; TEXT COMPRESSION;

D O I：

10.1007/BF02243872

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In recent publications about data compression, arithmetic codes are often suggested as the state of the art, rather than the more popular Huffman codes. While it is true that Huffman codes are not optimal in all situations, we show that the advantage of arithmetic codes in compression performance is often negligible. Referring also to other criteria, we conclude that for many applications, Huffman codes should still remain a competitive choice.

引用

页码：279 / 296

页数：18

共 45 条

[1]

ABRAMSON N, 1965, INFORMATION THEORY C

[2]

BAUER FL, 1973, INFORMATIK EINFUHREN

[3]

BELL TC, IN PRESS J ASIS

[4] MODELS OF BITMAP GENERATION - A SYSTEMATIC-APPROACH TO BITMAP COMPRESSION [J].

BOOKSTEIN, A ;

KLEIN, ST .

INFORMATION PROCESSING & MANAGEMENT, 1992, 28 (06) :735-748

[5] COMPRESSION, INFORMATION-THEORY, AND GRAMMARS - A UNIFIED APPROACH [J].

BOOKSTEIN, A ;

KLEIN, ST .

ACM TRANSACTIONS ON INFORMATION SYSTEMS, 1990, 8 (01) :27-49

[6] A SYSTEMATIC-APPROACH TO COMPRESSING A FULL-TEXT RETRIEVAL-SYSTEM [J].

BOOKSTEIN, A ;

KLEIN, ST ;

ZIFF, DA .

INFORMATION PROCESSING & MANAGEMENT, 1992, 28 (06) :795-806

[7]

BOOKSTEIN A, 1993, P DCC 93, P70

[8] BOUNDS ON THE REDUNDANCY OF HUFFMAN CODES [J].

CAPOCELLI, RM ;

GIANCARLO, R ;

TANEJA, IJ .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (06) :854-857

[9] NEW BOUNDS ON THE REDUNDANCY OF HUFFMAN CODES [J].

CAPOCELLI, RM ;

DESANTIS, A .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (04) :1095-1104

[10]

CHOUEKA Y, 1985, 8TH P ACM SIGIR C MO, P122

← 1 2 3 4 5 →