Paper Info
Title
Faster Implementation of Canonical Minimum Redundancy Prefix Codes
Abstract
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.
Year
Venue
Keywords
2001
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING
Huffman decoding,compression,algorithm,data structure,canonical Huffman tree
Field
DocType
Volume
Modified Huffman coding,Data structure,Computer science,Algorithm,Huffman coding,Redundancy (engineering),Decoding methods,DEFLATE,Prefix code,Canonical Huffman code
Journal
17
Issue
ISSN
Citations 
2
1016-2364
0
PageRank 
References 
Authors
0.34
2
2
Name
Order
Citations
PageRank
Kuo-Liang Chung11166121.24
Jung-Gen Wu2397.28