Faster implementation of canonical minimum redundancy prefix codes

K. L. Chung*, J. G. Wu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


This note modifies the data structure developed by Moffat and Turpin [3]. Besides reducing the memory requirement, the decoding algorithm is further improved. Experimental results demonstrate both the memory and decoding-time advantages of the modified method.

Original languageEnglish
Pages (from-to)341-345
Number of pages5
JournalJournal of Information Science and Engineering
Issue number2
Publication statusPublished - 2001 Mar
Externally publishedYes


  • Algorithm
  • Canonical Huffman tree
  • Compression
  • Data structure
  • Huffman decoding

ASJC Scopus subject areas

  • Software
  • Human-Computer Interaction
  • Hardware and Architecture
  • Library and Information Sciences
  • Computational Theory and Mathematics


Dive into the research topics of 'Faster implementation of canonical minimum redundancy prefix codes'. Together they form a unique fingerprint.

Cite this