KJCKorea
Journal Central

@article{ART001080862},
author={Sangho Park},
title={Efficient Huffman Decoding using Canonical Huffman Tree},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2007},
volume={12},
number={4},
pages={111-118}

TY - JOUR
AU - Sangho Park
TI - Efficient Huffman Decoding using Canonical Huffman Tree
JO - Journal of The Korea Society of Computer and Information
PY - 2007
VL - 12
IS - 4
PB - The Korean Society Of Computer And Information
SP - 111
EP - 118
SN - 1598-849X
AB - 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.
KW - Huffman code;Decoding algorithm
DO -
UR -
ER -

Sangho Park. (2007). Efficient Huffman Decoding using Canonical Huffman Tree. Journal of The Korea Society of Computer and Information, 12(4), 111-118.

Sangho Park. 2007, "Efficient Huffman Decoding using Canonical Huffman Tree", Journal of The Korea Society of Computer and Information, vol.12, no.4 pp.111-118.

Sangho Park "Efficient Huffman Decoding using Canonical Huffman Tree" Journal of The Korea Society of Computer and Information 12.4 pp.111-118 (2007) : 111.

Sangho Park. Efficient Huffman Decoding using Canonical Huffman Tree. 2007; 12(4), 111-118.

Sangho Park. "Efficient Huffman Decoding using Canonical Huffman Tree" Journal of The Korea Society of Computer and Information 12, no.4 (2007) : 111-118.

Sangho Park. Efficient Huffman Decoding using Canonical Huffman Tree. Journal of The Korea Society of Computer and Information, 12(4), 111-118.

Sangho Park. Efficient Huffman Decoding using Canonical Huffman Tree. Journal of The Korea Society of Computer and Information. 2007; 12(4) 111-118.

Sangho Park. Efficient Huffman Decoding using Canonical Huffman Tree. 2007; 12(4), 111-118.

Sangho Park. "Efficient Huffman Decoding using Canonical Huffman Tree" Journal of The Korea Society of Computer and Information 12, no.4 (2007) : 111-118.