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

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 studi...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Bao Ergude, Li Weisheng, Fan Dongrui, Ma Xiaoyu
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Binary sequences canonical Huffman tree compressing ratio Computer architecture Computer science Costs Decoding Huffman codes Huffman coding Laboratories Magnetic heads new condensed Huffman table Software algorithms Software engineering
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
DOI:	10.1109/CSSE.2008.1432