A multiple-extension adaptive Huffman code

A multiple-extension adaptive Huffman code

This thesis consists of the design, implementation, and evaluation of a lossless data compression code that uses adaptive Huffman techniques for encoding multiple extensions of a source alphabet. The proposed code uses dual encoding trees as in [Lu..] along with modifications to the adaptive Huffman...

Ausführliche Beschreibung

Bibliographische Detailangaben
1. Verfasser: Agustin, Luisito L.
Format: Abschlussarbeit
Sprache:English
Schlagworte:
Data compression (Computer science).
Algorithms.
Coding theory.