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
相关论文
共 50 条
  • [1] BOUNDS ON THE REDUNDANCY OF HUFFMAN CODES
    CAPOCELLI, RM
    GIANCARLO, R
    TANEJA, IJ
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (06) : 854 - 857
  • [2] Tight Bounds on the Redundancy of Huffman Codes
    Mohajer, Soheil
    Pakzad, Payam
    Kakhbod, Ali
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (11) : 6737 - 6746
  • [3] Tight bounds on the redundancy of Huffman codes
    Mohajer, Soheil
    Pakzad, Payam
    Kakhbod, Ali
    2006 IEEE INFORMATION THEORY WORKSHOP, 2006, : 131 - +
  • [4] TIGHT BOUNDS ON THE REDUNDANCY OF HUFFMAN CODES
    MANSTETTEN, D
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (01) : 144 - 151
  • [5] Redundancy-Related Bounds for Generalized Huffman Codes
    Baer, Michael B.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (04) : 2278 - 2290
  • [6] TIGHT UPPER-BOUNDS ON THE REDUNDANCY OF HUFFMAN CODES
    CAPOCELLI, RM
    DESANTIS, A
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (05) : 1084 - 1091
  • [7] Lower Bounds on the Redundancy of Huffman Codes With Known and Unknown Probabilities
    Blanes, Ian
    Hernandez-Cabronero, Miguel
    Serra-Sagrista, Joan
    Marcellin, Michael W.
    IEEE ACCESS, 2019, 7 : 115857 - 115870
  • [8] On the redundancy achieved by Huffman codes
    DePrisco, R
    DeSantis, A
    INFORMATION SCIENCES, 1996, 88 (1-4) : 131 - 148
  • [9] ON THE REDUNDANCY OF BINARY HUFFMAN CODES
    JOHNSEN, O
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (02) : 220 - 223
  • [10] LOCAL REDUNDANCY AND PROGRESSIVE BOUNDS ON THE REDUNDANCY OF A HUFFMAN CODE
    YEUNG, RW
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (03) : 687 - 691
12345