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 条
  • [41] ON THE MAXIMUM LENGTH OF HUFFMAN CODES
    BURO, M
    INFORMATION PROCESSING LETTERS, 1993, 45 (05) : 219 - 223
  • [42] Some Upper Bounds on the Redundancy of Optimal Binary Fix-Free Codes
    Khosravifard, Mohammadali
    Kheradmand, Shima
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (06) : 4049 - 4057
  • [43] Guaranteed synchronization of huffman codes
    Biskup, Marek Tomasz
    DCC: 2008 DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2008, : 462 - 471
  • [44] Parallel construction of Huffman Codes
    Ostadzadeh, S. Arash
    Moulavi, M. Amir
    Zeinalpour, Zeinab
    Elahi, B. Maryam
    ADVANCES IN SYSTEMS, COMPUTING SCIENCES AND SOFTWARE ENGINEERING, 2006, : 17 - +
  • [45] FAST DECODING OF THE HUFFMAN CODES
    SIEMINSKI, A
    INFORMATION PROCESSING LETTERS, 1988, 26 (05) : 237 - 241
  • [46] MINIMUM VARIANCE HUFFMAN CODES
    KOU, LT
    SIAM JOURNAL ON COMPUTING, 1982, 11 (01) : 138 - 148
  • [47] Approximating Huffman codes in parallel
    Berman, P
    Karpinski, M
    Nekrich, Y
    AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 845 - 855
  • [48] Speech compression with Huffman codes
    MacDonald, R.I., 1600, (16):
  • [49] ON THE COMPETITIVE OPTIMALITY OF HUFFMAN CODES
    COVER, TM
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (01) : 172 - 174
  • [50] Approximating Huffman codes in parallel
    Berman, P.
    Karpinski, M.
    Nekrich, Y.
    JOURNAL OF DISCRETE ALGORITHMS, 2007, 5 (03) : 479 - 490
12345