TIGHT BOUNDS ON THE REDUNDANCY OF HUFFMAN CODES

被引：38
|
作者：
MANSTETTEN, D
机构：
[1] BULL AG, COLOGNE, GERMANY
[2] RHEIN WESTFAL TH AACHEN, LEHRSTUHL ANGEW MATH INSBESONDERE INFORMAT, W-5100 AACHEN, GERMANY
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1992年 / 38卷 / 01期
关键词：
BINARY HUFFMAN CODE; D-ARY HUFFMAN CODE; REDUNDANCY; UPPER AND LOWER BOUNDS;
D O I：
10.1109/18.108260
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A method for deriving optimal upper bounds on the redundancy of binary Huffman codes in terms of the probability p1 of the most likely source letter is presented. This method will be used to compute bounds for all p1 greater-than-or-equal-to 1/127, which were previously known only for a few special cases. Furthermore, the known optimal lower bound for binary Huffman codes is generalized to arbitrary code alphabets and some upper bounds for D-ary Huffman codes, 2 less-than-or-equal-to D < infinity, are given, which are the tightest possible for all p1 greater-than-or-equal-to 1/2.
引用
收藏
页码：144 / 151
页数：8
相关论文
共 50 条
  • [1] Tight Bounds on the Redundancy of Huffman Codes
    Mohajer, Soheil
    Pakzad, Payam
    Kakhbod, Ali
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (11) : 6737 - 6746
  • [2] Tight bounds on the redundancy of Huffman codes
    Mohajer, Soheil
    Pakzad, Payam
    Kakhbod, Ali
    [J]. 2006 IEEE INFORMATION THEORY WORKSHOP, 2006, : 131 - +
  • [3] TIGHT UPPER-BOUNDS ON THE REDUNDANCY OF HUFFMAN CODES
    CAPOCELLI, RM
    DESANTIS, A
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (05) : 1084 - 1091
  • [4] BOUNDS ON THE REDUNDANCY OF HUFFMAN CODES
    CAPOCELLI, RM
    GIANCARLO, R
    TANEJA, IJ
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (06) : 854 - 857
  • [5] NEW BOUNDS ON THE REDUNDANCY OF HUFFMAN CODES
    CAPOCELLI, RM
    DESANTIS, A
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (04) : 1095 - 1104
  • [6] Redundancy-Related Bounds for Generalized Huffman Codes
    Baer, Michael B.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (04) : 2278 - 2290
  • [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.
    [J]. IEEE ACCESS, 2019, 7 : 115857 - 115870
  • [8] On the redundancy achieved by Huffman codes
    DePrisco, R
    DeSantis, A
    [J]. INFORMATION SCIENCES, 1996, 88 (1-4) : 131 - 148
  • [9] ON THE REDUNDANCY OF BINARY HUFFMAN CODES
    JOHNSEN, O
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (02) : 220 - 223
  • [10] Tight Upper Bounds on the Redundancy of Optimal Binary AIFV Codes
    Hu, Weihua
    Yamamoto, Hirosuke
    Honda, Junya
    [J]. 2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 6 - 10
12345