Huffman coding with an infinite alphabet

被引：18
|
作者：
Kato, A
Han, TS
Nagaoka, H
机构：
[1] Graduate School of Information Systems, University of Electro-Communications, Chofu-shi, Tokyo 185, 1-5-1, Chotugaoka
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1996年 / 42卷 / 03期
关键词：
optimal prefix code; Huffman algorithm; Shannon entropy; infinite alphabet; coding of integers;
D O I：
10.1109/18.490559
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A new type of sufficient condition is provided for a probability distribution on the nonnegative integers to be given an optimal D-ary prefix code by a Huffman-type algorithm, In the justification of our algorithm, we introduce two new (essentially one) concepts as the definition of the ''optimality'' of a prefix D-ary code, which are shown to be equivalent to that defined in the traditional way, These new concepts of the optimality are meaningful even for the case where the Shannon entropy H(P) diverges.
引用
收藏
页码：977 / 984
页数：8
相关论文
共 50 条
  • [1] Alphabet partitioning techniques for semiadaptive Huffman coding of large alphabets
    Chen, Dan
    Chiang, Yi-Jen
    Memon, Nasir
    Wu, Xiaolin
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2007, 55 (03) : 436 - 443
  • [2] Prediction and adaptive coding of sources with large or infinite alphabet.
    Ryabko, B
    Astola, J
    [J]. 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 24 - 24
  • [3] Performance Comparison of Huffman Coding and Double Huffman Coding
    Arshad, Rabia
    Saleem, Adeel
    Khan, Danista
    [J]. 2016 SIXTH INTERNATIONAL CONFERENCE ON INNOVATIVE COMPUTING TECHNOLOGY (INTECH), 2016, : 361 - 364
  • [4] Huffman Coding
    Moffat, Alistair
    [J]. ACM COMPUTING SURVEYS, 2019, 52 (04)
  • [5] Huffman Redundancy for Large Alphabet Sources
    Narimani, Hamed
    Khosravifard, Mohammadali
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (03) : 1412 - 1427
  • [6] On Variable-to-Fixed Length Coding of A General Source with Infinite Alphabet
    Arimura, Mitsuharu
    Iwata, Ken-ichi
    [J]. 2012 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2012), 2012, : 485 - 488
  • [7] AGAIN - HUFFMAN CODING
    BLUMER, A
    [J]. COMMUNICATIONS OF THE ACM, 1986, 29 (07) : 680 - 680
  • [8] Bidirectional Huffman coding
    [J]. Fraenkel, A.S., 1600, (33):
  • [9] IS HUFFMAN CODING DEAD
    BOOKSTEIN, A
    KLEIN, ST
    [J]. COMPUTING, 1993, 50 (04) : 279 - 296
  • [10] DYNAMIC HUFFMAN CODING
    VITTER, JS
    [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1989, 15 (02): : 158 - 167
12345