Skip to main content

Understandable Huffman Coding: A Case Study

  • Conference paper
  • First Online:
Soft Computing: Theories and Applications

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 742))

  • 836 Accesses

Abstract

For the compression of images, the needs of some techniques for compressing the images is always increasing as when the images are raw, they do need additional space in the disk and as far as the transmission and their storage is concerned it is a big disadvantage. Though for the compression of images, there are a lot of latest techniques available nowadays, but the fast and efficient one is the technique which generally goes well with the client’s requirements. The lossless method of compression and decompression of images is studied in this paper with the help of a simple and efficient technique for coding known as Huffman’s coding. As far as implementation is concerned, the technique is simple and comparatively lesser memory is needed for its execution. There has been a special software algorithm which is generated and also implemented to either compress or decompress the images with the help of Huffman techniques of coding images in a platform known as MATLAB.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Compression Using Fractional Fourier Transform A Thesis Submitted in the partial fulfillment of requirement for the award of the degree of Master of Engineering In Electronics and Communication. By Parvinder Kaur

    Google Scholar 

  2. Ternary Tree & FGK Huffman Coding Technique Dr. Pushpa R. Suri † and Madhu Goel Department of Computer Science & Applications, Kurukshetra University, Kurukshetra, India

    Google Scholar 

  3. Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science

    Google Scholar 

  4. Huffman, D.A.: A Method for the construction of minimum-redundancy codes. Proc. IRE 40(10), 1098–1101 (1952)

    Article  Google Scholar 

  5. Efficient Huffman decoding by Manoj Aggrawal and Ajai Narayan

    Google Scholar 

  6. Kanzariya, N., Nimavat, A., Patel, H.: Security of digital images using steganography techniques based on LSB, DCT, and Huffman encoding. In: Proceedings of International conference on Advances in Signal Processing and Communication (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Indu Maurya .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Maurya, I., Gupta, S.K. (2019). Understandable Huffman Coding: A Case Study. In: Ray, K., Sharma, T., Rawat, S., Saini, R., Bandyopadhyay, A. (eds) Soft Computing: Theories and Applications. Advances in Intelligent Systems and Computing, vol 742. Springer, Singapore. https://doi.org/10.1007/978-981-13-0589-4_14

Download citation

Publish with us

Policies and ethics