Huffman Coding -Students Report- Group B

Introduction
The technique developed by David Huffman part of an
important class, which was the first in the information theory
was taught by Robert Fano. created symbols using this
technique for this call for Huffman code.
These codes are encrypted and prefix optimum total chances and
make Hoffman is based on two observations regarding the
optimum code prefix :-
1- at top code, symbols that occur frequently have the highest
probability of occurrence and will have a shorter code.
2- In extreme symbol, symbols least will have the same length.
Symbols that occur most often in abundance if she had the
longest codeword of the code that have occurred less often, the
average number of objects for each code words will be greater if
it reflected conditions.
Huffman adds a simple requirement for two observations, which
is that the codeword corresponding to the lower probability
symbolic different in the last piece and the very simple encrypts
This method has been the subject of research center, where the
data compression algorithm start to build the list of all the
symbols of the alphabet in decline request Ahtmalathm . Then
builds a tree, the symbol in each sheet from bottom to top.
Canonical Huffman Codes
Huffman code needs to reflect the statistics source encodes a
source very different statistics and the inclusion of Huffman
code with a compact representation of the source, depending on
the size of the alphabet and is useful for the development of