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 条

[41] ARITHMETIC CODING FOR DATA-COMPRESSION
WITTEN, IH
NEAL, RM
CLEARY, JG
[J]. COMMUNICATIONS OF THE ACM, 1987, 30 (06) : 520 - 540
[42] UNIVERSAL ALGORITHM FOR SEQUENTIAL DATA COMPRESSION
ZIV, J
LEMPEL, A
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (03) : 337 - 343
[43] COMPRESSION OF INDIVIDUAL SEQUENCES VIA VARIABLE-RATE CODING
ZIV, J
LEMPEL, A
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (05) : 530 - 536
[44] [No title captured]
[45] [No title captured]

← 1 2 3 4 5 →