Abstract
Method compression of text by using algorithm Huffman gives storage thrift of data. This method is algorithm that is most famous to compress of text. This algorithm applies system encoding with bit network, where character which the frequency is often is decoded with short bit network and character which the frequency seldom be decoded with long bit network. There is three steps in using algorithm Huffman that is first phase of forming of tree Huffman where at this phase by using this Huffman tree minimization of scanning path length will by the way of putting down information often emerges close to root and information which seldom emerge far from root, second phase is encoding that is way is compiling string binary read from root up to tree leaf Huffman, and third phase that is decoding returns from code which has been formed. Keywords : Huffman’s Algorithm, Huffman Tree, Encoding, Decoding
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
