An efficient decoding technique for Huffman codes

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.


Download / Buy Article:

Keywords: Complete binary tree; Data structures; Static Huffman code

Document Type: Short Communication


Affiliations: Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, -1000, Dhaka, Bangladesh

Publication date: March 31, 2002

Related content



Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more