Abstract
Huffman coding is a simple lossless data compression technique that tries to take advantage of entropy by using a Variable-Length encoding to build a code table to encode a source file symbols. In this paper, we have re-visited Huffman coding and enhance it by considering the second order form of characters rather the first order form of characters. Results showed that using the second order form improves the compression ratio by around 8% than the existing Huffman coding.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Mathews, G.J.: Selecting a General-Purpose Data Compression Algorithm. In: Proceedings of the Science Information Management and Data Compression Workshop, pp. 55–64. NASA science Publication 3315, USA (1995)
Ziviani, N., Moura, E., Navarro, G., Baeza-Yates, R.: Compression: A Key for Next-Generation Text Retrieval Systems. IEEE Computer 33(11), 37–44 (2000)
Mandal, J.: An Approach Towards Development of Efficient Data Compression Algorithms and Correction Techniques. Ph. D. Dissertation, Jadavpur University, India (2000)
Brisaboa, N., Iglesias, E., Navarro, G., Parama, J.: An Efficient Compression Code for Text Databases. In: Proceedings of 25th European Conference on IR Research, ECIR, Italy, pp. 468–481 (2003)
Cutter Network site, http://www.bestdatasource.com/RAD/VMUX2100.htm (visited June 2006)
Servetto, S.: Compression and Reliable Transmission of Digital Image and Video Signals. Ph.D Dissertation, University of Illinois at Urbana-Champaign, USA (1999)
University of South Carolina (USC), http://ip.research.sc.edu/catalog/97154sw.htm (visited June 2006)
Adler, M., Mitzenmacher, M.: Towards Compressing Web Graphs. In: Proc. of the IEEE Data Compression Conference, Utah, USA, pp. 203–212 (2001)
Wu, D., Hou, Y., Zhu, W., Zhang, Y., Peha, J.: Streaming Video over the Internet: Approaches and Directions. IEEE Trans. on Circuits and Systems for Video Technology 11(3), 282–300 (2001)
El-Qawasmeh, E., Al-Towaiq, M., Snasel, V.: Increasing The Efficiency of Data Compression. In: Proceedings of National Conference on Software Engineering & Computer Systems 2007 (NaCSES’07), Kuantan, Malaysia, August 20-21, pp. 1–6 (2007)
Vitter, J.S.: Dynamic Huffman Coding. Journal of ACM 15(2), 158–167 (1989)
Huffman, D.: A Method for the Construction of Minimum-Redundancy Codes. Proceedings IRE 40(9), 1089–1101 (1952)
Nelson, M.: LZW Data Compression. Dr. Dobb’s Journal 14(10), 62–75 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
El-Qawasmeh, E., Mansour, A., Al-Towiq, M. (2010). Development of a New Compression Scheme. In: Zavoral, F., Yaghob, J., Pichappan, P., El-Qawasmeh, E. (eds) Networked Digital Technologies. NDT 2010. Communications in Computer and Information Science, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14292-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-14292-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14291-8
Online ISBN: 978-3-642-14292-5
eBook Packages: Computer ScienceComputer Science (R0)