본문 바로가기
  • Home

Efficient Huffman Decoding using Canonical Huffman Tree

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2007, 12(4), pp.111-118
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sangho Park 1

1안동대학교

Accredited

ABSTRACT

We present an efficient decoding scheme for Huffman codes in which we use a properties of canonical prefix tree. After Huffman tree is converted to canonical Huffman tree, we represent Huffman tree with minimum information using rules associated with values of nodes in canonical tree. The proposed scheme can reduce memory to store Huffman tree information while maintains the same processing time. The memory size in order to represent tree information is log which is less than those of previous methods. But the number of search is similar to previously proposed techniques.

Citation status

* References for papers published after 2022 are currently being built.