Language selection
 English language   French language 

 
You are visitor
 0 0 0 0 0 0
 
Search
 
Theme selection

 
Last Blog subject
Analyzing ...
 
Data compressor using the Huffman algorithms
Domain
Data compression
Context
Training period for research's works initiation, in school period
Period
January 2003   -   March 2003
State
Finished
Language(s)
C
Link(s)
source code

Description
I performed this utility in the beginning of the year 2003, during a training period of research initiation.

    The objective was to confront it to other data compressor and to select the more interesting for the project which was "quick data compression for transfer through a network". Eventually, the performances of the Huffman algorithm were less interesting than some others compression algorithms tested, as zip for instance.

    Nevertheless, this utility stays interesting for people wishing to study or analyse the Huffman algorithms (the utility provides some commands possibilities which allow obtaining some information about the compression).
There are two algorithms implemented in the utility:
   - The most famous which works with the character's occurrences ;
   - A simple algorithm which compresses more specifically the '\0' sequence (very useful for the RAM information compression which have often a lot of such sequence).
The first algorithm is used by default; the other can be actived by a command line.

Remark(s)    
Launch the application without parameter for obtaining command line information.
All the outputs of the utility are in French.

Installation
The zip contains:
   - the source code of all the utility ;
   - a makefile which has to be launched to produce the executable file ;
   - two csh scripts which allow to use the utility on a whole directory.

Copyright ©2003-2011 Bertrand BENOIT,  Linked LinkedIn profile profile.
Created the Sunday 05th October 2003. Last update the Thursday 08th September 2011.

You can download my Curriculum vitae.