Unlike to ASCII or Unicode, Huffman code uses different number of bits to encode letters.If the number of occurrence of any character is more, we use fewer numbers of bits.Huffman coding is a method for the construction of minimum redundancy codes.
Data compression have lot of advantages such as it minimizes cost, time, bandwidth, storage space for transmitting data from one place to another. In the ASCII code there are 256 characters and this leads to the use of 8 bits to represent each character but in any test file we do not have use all 256 characters. For example, in any English language text, generally the character e appears more than the character z. To achieve compression, we can often use a shorter bit string to represent more frequently occurring characters. We do not have to represent all 256 characters, unless they all appear in the document. The data encoding schemes broadly categorized in two categories. It allows source to be compressed and decompressed with zero error. The algorithm builds the tree T corresponding to the optimal code in a bottom-up manner. It begins with a set of C leaves (C is the number of characters) and perform C 1 merging operations to create the final tree. He spend most of his time in programming, blogging and helping other programming geeks. C Program For Arithmetic Coding Examples How To Find TheNow how to find the missing frequency range of that character.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |