By Topic

Compression of text and binary files using adaptive Huffman coding techniques

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Desoky, A. ; Dept, of Eng. Math. & Comput. Sci., Louisville Univ., KY, USA ; Gregory, M.

The authors measure the amount of compression that can be accomplished by the use of Huffman coding, and the effects of adaption based on the statistics of the input file. The coding algorithm has been designed to generate codes for character strings instead of for a single character. Each compressed file has a unique set of Huffman codes. The results of using adaptive Huffman coding algorithm has demonstrated that the larger the file the more useful the technique for compression. Also, the results show that the amount of memory that can be saved is up to 55.0% when text file is being used, and up to 40.9% when binary image file is being used

Published in:

Southeastcon '88., IEEE Conference Proceedings

Date of Conference:

11-13 Apr 1988