HUFFMAN CODE EFFICIENCIES FOR EXTENSIONS OF SOURCES

被引：5
|
作者：
FENWICK, PM
机构：
[1] Department of Computer Science, The University of Auckland, Auckland
来源：
IEEE TRANSACTIONS ON COMMUNICATIONS | 1995年 / 43卷 / 2-4期
关键词：
D O I：
10.1109/26.380027
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
It is well known that the efficiency of noiseless coding may be improved by coding extensions of the source; for large extensions the efficiency is arbitrarily close to unity. This paper shows that the efficiency is not always improved just by coding the next extension. In some cases the code of a larger extension is markedly less efficient than its predecessor, although always within the theoretical limits of efficiency. We show how the phenomenon arises from changes to the Huffman coding tree as the source probabilities change and investigate it for binary and ternary codes.
引用
收藏
页码：163 / 165
页数：3
相关论文
共 50 条
  • [1] Huffman code efficiencies for extensions of sources
    Fenwick, P.M.
    IEEE Transactions on Communications, 1995, 43 (2 -4 pt 1): : 163 - 169
  • [2] THE MINIMUM CODEWORD LENGTH AND REDUNDANCY IN THE BINARY HUFFMAN CODE FOR UNCERTAIN SOURCES
    BIRMIWAL, K
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (02) : 439 - 443
  • [3] On breaking a Huffman code
    Gillman, DW
    Mohtashemi, M
    Rivest, RL
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (03) : 972 - 976
  • [4] IS EVERY COMPACT CODE HUFFMAN
    WOOD, JH
    DISCRETE MATHEMATICS, 1992, 110 (1-3) : 297 - 299
  • [5] An efficient chain code with Huffman coding
    Liu, YK
    Zalik, B
    PATTERN RECOGNITION, 2005, 38 (04) : 553 - 557
  • [6] HUFFMAN-CODE CLARIFICATIONS - REPLY
    GRAPPEL, R
    EDN MAGAZINE-ELECTRICAL DESIGN NEWS, 1983, 28 (03): : 28 - 28
  • [7] AUTOMATIC GENERATION OF HUFFMAN COMPACT CODE
    PEARCE, E
    BATEMAN, BL
    TEXAS JOURNAL OF SCIENCE, 1972, 24 (03): : 367 - 367
  • [8] Development of Huffman Code for Lora Technology
    Pongpunpurt, Pramoth
    Khawsuk, Weerawat
    Sutthisangiam, Nikorn
    2019 IEEE SMARTWORLD, UBIQUITOUS INTELLIGENCE & COMPUTING, ADVANCED & TRUSTED COMPUTING, SCALABLE COMPUTING & COMMUNICATIONS, CLOUD & BIG DATA COMPUTING, INTERNET OF PEOPLE AND SMART CITY INNOVATION (SMARTWORLD/SCALCOM/UIC/ATC/CBDCOM/IOP/SCI 2019), 2019, : 1882 - 1887
  • [9] A NOTE ON THE COMPETITIVE OPTIMALITY OF THE HUFFMAN CODE
    FEDER, M
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (02) : 436 - 439
  • [10] HUFFMAN-SHANNON-FANO CODE
    CONNELL, JB
    PROCEEDINGS OF THE IEEE, 1973, 61 (07) : 1046 - 1047
12345