ALGORITHMS FOR ADAPTIVE HUFFMAN CODES

被引:30
|
作者
CORMACK, GV [1 ]
HORSPOOL, RN [1 ]
机构
[1] MCGILL UNIV,SCH COMP SCI,MONTREAL H3A 2K6,QUEBEC,CANADA
关键词
D O I
10.1016/0020-0190(84)90021-8
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:159 / 165
页数:7
相关论文
共 50 条
  • [41] An efficient decoding technique for Huffman codes
    Chowdhury, RA
    Kaykobad, M
    King, I
    INFORMATION PROCESSING LETTERS, 2002, 81 (06) : 305 - 308
  • [42] Optimal maximal and maximal prefix codes equivalent to Huffman codes
    Long, DY
    Jia, WJ
    2002 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-IV, PROCEEDINGS, 2002, : 2525 - 2528
  • [43] Weighted Adaptive Huffman Coding
    Fruchtman, Aharon
    Gross, Yoav
    Klein, Shmuel T.
    Shapira, Dana
    2020 DATA COMPRESSION CONFERENCE (DCC 2020), 2020, : 368 - 368
  • [44] MODIFIED BARKER AND HUFFMAN SEQUENCES IN COMBINATION CODES
    HUFFMAN, DL
    IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 1977, 13 (04) : 408 - 413
  • [45] A new bound for the data expansion of Huffman codes
    DePrisco, R
    DeSantis, A
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (06) : 2028 - 2032
  • [46] Algorithmic counting of nonequivalent compact Huffman codes
    Elsholtz, Christian
    Heuberger, Clemens
    Krenn, Daniel
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2024, 35 (06) : 887 - 903
  • [47] JOINT SOURCE-CHANNEL DECODING OF HUFFMAN CODES WITH LDPC CODES
    Mei Zhonghui Wu Lenan (Department of Radio Engineering
    Journal of Electronics(China), 2006, (06) : 806 - 809
  • [48] Huffman Codes versus Augmented Non-Prefix-Free Codes
    Adas, Boran
    Bayraktar, Ersin
    Kulekci, M. Oguzhan
    EXPERIMENTAL ALGORITHMS, SEA 2015, 2015, 9125 : 315 - 326
  • [49] HUFFMAN CODES AND MAXIMIZING PROPERTIES OF FIBONACCI NUMBERS
    VINOKUR, AB
    CYBERNETICS AND SYSTEMS ANALYSIS, 1992, 28 (03) : 329 - 334
  • [50] A simple upper bound on the redundancy of Huffman codes
    Ye, CX
    Yeung, RW
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (07) : 2132 - 2138