A Study and Implementation of the Huffman Algorithm Based on Condensed Huffman Table

Author

Ergude, Bao ; Weisheng, Li ; Dongrui, Fan ; Xiaoyu, Ma

Author_Institution

Sch. of Software, Beijing Jiaotong Univ., Beijing, China

Volume

6

fYear

2008

fDate

12-14 Dec. 2008

Firstpage

42

Lastpage

45

Abstract

Huffman codes are being widely used as a very efficient technique for compressing data. To achieve high compressing ratio, some properties of encoding and decoding for canonical Huffman table are discussed. A study and implementation of the Huffman algorithm based on condensed Huffman table is studied. New condensed Huffman table could reduce the cost of the Huffman coding table. Compared with traditional Huffman coding table and other improved tables, the best advantages of new condensed Huffman table is that the space requirement is reduced significantly.

Keywords

Huffman codes; data compression; decoding; Huffman encoding algorithm; condensed canonical Huffman table; data compression; decoding; Binary sequences; Computer architecture; Computer science; Costs; Decoding; Huffman coding; Laboratories; Magnetic heads; Software algorithms; Software engineering; Huffman codes; canonical Huffman tree; compressing ratio; new condensed Huffman table;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Software Engineering, 2008 International Conference on

Conference_Location

Wuhan, Hubei

Print_ISBN

978-0-7695-3336-0

Type

conf

DOI

10.1109/CSSE.2008.1432

Filename

4723192