Enhanced LZW Algorithm with Less Compression Ratio

Setia, Amit; Ahlawat, Priyanka

doi:10.1007/978-81-322-0740-5_41

Amit Setia⁵ &
Priyanka Ahlawat⁵

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

1931 Accesses
2 Citations

Abstract

LZW is the one known compression algorithm appropriate for communication. LZW data compression algorithm is popular for data compression because it is an adaptive algorithm and achieves an excellent compromise between compression performance and speed of execution. LZW is a dictionary based data compression algorithm, which compress the data in a lossless manner so that no information is lost. LZW algorithm requires no extra communication from the encoder to the decoder. In this paper we present a scheme to eliminate the spaces from the data so that high compression factor achieves.

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

Access this chapter

Log in via an institution

Chapter: USD 29.95; Price excludes VAT (USA)

eBook: USD 259.00; Price excludes VAT (USA)

Softcover Book: USD 329.99; Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

References

Jiang, J.: Pipeline algorithm of RSA data encryption and data compression. In: IEEE Proceeding of International Conference on Communication Technology, vol. 2, pp. 1088–1091 (1996)
Google Scholar
Kruse, H., Mukherjee, A.: Data compression using text encryption. In: IEEE Data Compression Conference, p. 447 (1997)
Google Scholar
Lin, M.B., Chang, Y.Y.: A new architecture of a two-stage lossless data compression and decompression algorithm. IEEE Transaction on VLSI Systems 17, 1297–1303 (2009)
Article Google Scholar
Welch, T.: A technique for high performance data compression. IEEE Computer 17, 8–19 (1984)
Article Google Scholar
Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transaction on Information Theory 23, 337–343 (1977)
Article MathSciNet MATH Google Scholar
Ziv, J., Lempel, A.: Compression of individual sequences via variable length coding. IEEE Transaction on Information Theory 24, 530–536 (1978)
Article MathSciNet MATH Google Scholar

Download references

Author information

Authors and Affiliations

Department of Computer Engineering, National Institute of Technology, Kurukshetra, India
Amit Setia & Priyanka Ahlawat

Authors

Amit Setia
View author publications
You can also search for this author in PubMed Google Scholar
Priyanka Ahlawat
View author publications
You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Amit Setia .

Editor information

Editors and Affiliations

M. S. Ramaiah Institute of Technology, Bengaluru, India
Aswatha Kumar M.
M. S. Ramaiah Institute of Technology, Bengaluru, India
Selvarani R.
M. S. Ramaiah Institute of Technology, Bengaluru, India
T V Suresh Kumar

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Setia, A., Ahlawat, P. (2013). Enhanced LZW Algorithm with Less Compression Ratio. In: Kumar M., A., R., S., Kumar, T. (eds) Proceedings of International Conference on Advances in Computing. Advances in Intelligent Systems and Computing, vol 174. Springer, New Delhi. https://doi.org/10.1007/978-81-322-0740-5_41

Download citation

DOI: https://doi.org/10.1007/978-81-322-0740-5_41
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-0739-9
Online ISBN: 978-81-322-0740-5
eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics