NEW BOUNDS ON THE REDUNDANCY OF HUFFMAN CODES

被引:28
作者
CAPOCELLI, RM [1 ]
DESANTIS, A [1 ]
机构
[1] UNIV SALERNO,DIPARTIMENTO INFORMAT & APPLICAZ,BARONISSI,ITALY
关键词
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 条