IDEAS home Printed from https://ideas.repec.org/a/bla/jamest/v46y1995i1p1-8.html
   My bibliography  Save this article

Efficient decoding of compressed data

Author

Listed:
  • Mostafa A. Bassiouni
  • Amar Mukherjee

Abstract

In this article, we discuss the problem of enhancing the speed of Huffman decoding. One viable solution to this problem is the multibit scheme which uses the concept of k‐bit trees to decode up to k bits at a time. A linear‐time optimal solution for the mapping of 2‐bit trees into memory is presented. The optimal solution is derived by formulating the memory mapping problem as a binary string mapping problem and observing that at most four different 4‐bit patterns can occur within any 2‐bit Huffman tree. In addition to reducing the processing time of decoding, the optimal scheme is storage efficient, does not require changes to the encoding process, and is suitable for hardware implementations. © 1995 John Wiley & Sons, Inc.

Suggested Citation

  • Mostafa A. Bassiouni & Amar Mukherjee, 1995. "Efficient decoding of compressed data," Journal of the American Society for Information Science, Association for Information Science & Technology, vol. 46(1), pages 1-8, January.
    • Handle: RePEc:bla:jamest:v:46:y:1995:i:1:p:1-8
    DOI: 10.1002/(SICI)1097-4571(199501)46:13.0.CO;2-U
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1097-4571(199501)46:13.0.CO;2-U
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1097-4571(199501)46:13.0.CO;2-U?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:bla:jamest:v:46:y:1995:i:1:p:1-8. 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: Wiley Content Delivery (email available below). General contact details of provider: http://www.asis.org .

    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.