NEW BOUNDS ON THE REDUNDANCY OF HUFFMAN CODES

被引：28

作者：

CAPOCELLI, RM ^{[1
]}

DESANTIS, A ^{[1
]}

机构：

[1] UNIV SALERNO,DIPARTIMENTO INFORMAT & APPLICAZ,BARONISSI,ITALY

来源：

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

关键词：

REDUNDANCY; REDUNDANCY OF HUFFMAN CODES; BOUNDS ON THE REDUNDANCY;

D O I：

10.1109/18.87001

中图分类号：

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

学科分类号：

0812 ;

摘要：

Upper and lower bounds, which are the tightest possible, are obtained for the redundancy r of binary Huffman codes for a memoryless source whose least likely source letter probability is known. Also provided are tight upper bounds on r in terms of the most and the least likely source letter probabilities.

引用

页码：1095 / 1104

页数：10

共 12 条

[1] OPTIMUM 1-ENDED BINARY PREFIX CODES [J].

BERGER, T ;

YEUNG, RW .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (06) :1435-1441

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

CAPOCELLI, RM ;

GIANCARLO, R ;

TANEJA, IJ .

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

[3]

CAPOCELLI RM, 1990, JAN IEEE INT S INF T

[4]

CAPOCELLI RM, 1988, JUN IEEE INT S INF T

[5]

CAPOCELLI RM, IBM RC14154 RES REP

[6]

CAPOCELLI RM, 1989, IEEE T INFORM THEORY, V35

[7] VARIATIONS ON A THEME BY HUFFMAN [J].

GALLAGER, RG .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (06) :668-674

[8]

HORIBE Y, 1977, INFORM CONTR, V24, P148

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

HUFFMAN, DA .

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

[10] ON THE REDUNDANCY OF BINARY HUFFMAN CODES [J].

JOHNSEN, O .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (02) :220-223

← 1 2 →