Project Name:
Huff-Man Code
Project Description:
In Computer science and Information theory, a Huffman code is an optimal prefix code found using algorithm developed by David A. Huffman. The process of finding or using the code is called “Huffman coding”. Huffman coding is a common technique in encoding.
The technique works by creating a binary tree of nodes. These can be stored in a regular array, the size of which depends on the number of symbol or alphabets.
The process starts from leaf node. It is based on frequency of occurrence of a data item. The principle is to use a lower number of bits to encode the data that occurs more frequently. Codes are stored in a code Book which may be constructed for each image.
What are you going to use Huffman codes for? You do not have to tell us what Huffman codes are. Tell me what you will use them for? The information you have shared is insufficient.
ReplyDeleteSir actually Huffman coding is a specific method for choosing the representation for each symbol, resulting in a prefix code and we are using it for encoding and decoding the data
ReplyDeleteEncoding and Decoding of which data?
ReplyDeleteSir, Encoding the data represented in String into Binary form (binary code). In this way we no loss of data and compression is also achieved. While in Decoding the Binary data is then decode into its original form (string form).
ReplyDeleteHuffman coding is used to compress nearly all sorts of data. Winrar is the best example of it.
Yes for example if you write any letter and you wan't to keep the message secret to the irrelevant person you can convert your message into huffman code.
ReplyDeletehuffman code is usually used to compress the data not to encode it for secret messages...
ReplyDeleteu can compress the data of 10MB to 1MB (rough estimate) through huffman code technique.
-Atayyab
Hmm you guys could discuss with Atayyab to see if you can refine your project. Then update with the latest updates here.
ReplyDeleteAny new updates to share with us?
ReplyDelete