IDEAS home Printed from https://ideas.repec.org/a/icf/icfjcs/v7y2013i2p25-38.html
   My bibliography  Save this article

An Innovative Idea to Represent Tree in Huffman Data Compression Algorithm

Author

Listed:
  • Satyendra Nath Mandal

Abstract

Huffman tree has to be developed before data compression and decompression in Huffman data compression algorithm. The sender has to send tree information to the receiver separately to decompress the data. As a result, the bandwidth of the network was wasted and the complexity of the algorithm increased in both the cases, i.e., time and space. In this paper, an effort has been made to improve the efficiency of data compression in Huffman data compression technique. The Huffman tree is represented by strings of 0s and 1s. The information to develop the Huffman tree is sent with the compressed data as a string of characters without any flag/separator to distinguish the end of the represented tree and the compressed data. A comparison is made between the proposed method and the existing technique to compress the same data. Finally, it is observed that the proposed method is more efficient than the existing method in representing a tree in Huffman data compression algorithm.

Suggested Citation

  • Satyendra Nath Mandal, 2013. "An Innovative Idea to Represent Tree in Huffman Data Compression Algorithm," The IUP Journal of Computer Sciences, IUP Publications, vol. 0(2), pages 25-38, April.
    • Handle: RePEc:icf:icfjcs:v:7:y:2013:i:2:p:25-38
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:icf:icfjcs:v:7:y:2013:i:2:p:25-38. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: G R K Murty (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.