Position index preserving compression of text data

Authors

  • Nasim Akhtar Department of Information Technology, Moscow State Academy of Fine Chemical Technology, Moscow, Russia
  • Mamunur Rashid Department of Information Technology, Moscow State Academy of Fine Chemical Technology, Moscow, Russia
  • Shafiqul Islam Department of Information Technology, Moscow State Academy of Fine Chemical Technology, Moscow, Russia
  • Mohammod Abul Kashem Department of Computer Science & Engineering, Dhaka University of Engineering & Technology, Gazipur, Bangladesh
  • Cyrll Y. Kolybanov Department of Information Technology, Moscow State Academy of Fine Chemical Technology, Moscow, Russia

Keywords:

index, LIPT, PIPC, Compression, IDBE

Abstract

Data compression offers an attractive approach to reducing communication cost by using available bandwidth effectively. It also secures data during transmission for its encoded form. In this paper an index based position oriented lossless text compression called PIPC ( Position Index Preserving Compression) is developed. In PIPC the position of the input word is denoted by ASCII code. The basic philosopy of the secure compression is to preprocess the text and transform it into some intermediate file which can be compressed with better efficiency and which exploits the natural redundancy of the languaje in making the transformation. The proposed algorithm compresses the data 35 % to 50 % of its original size depending on occurrence of repeat word

Downloads

Download data is not yet available.

References

[1]Suzzane Button, "On-line Stochastic Processes in Data Compression", Doctoral Dissertation, University of Washington, Dept. of Computer Science and Engineering, 1996, pp 3-4.
[2] M. Burrows and D. J. Wheeler, "A Block-sorting Lossless Data Compression Algorithm", SRC Research Report 124, Digital Systems Research Center, 2000, pp 12-14.
[3] J. Ziv and A. Lempel, "A Universal Algorithm for Sequential Data Compression", IEEE Trans. Information Theory, IT-23, 1999, pp. 237-243.
[4] F. Awan, A. Mukherjee, "LIPT: A lossless Text Transform to Improve Compression", Proceeding of International Conference on Information and Theory: Coding and computing, IEEE Computer Society Less Vegas Nevada, 2001, pp 47-51.
[5] H. Kruse and A. Mukherjee "Data Compression Using Text Encryption", Proc Data Compression Conference, 1997, IEEE Computer Society Press, pp. 447-448.
[6] D.A Huffman, "A Method for the Construction of Minimum Redundancy Codes", Proc. IRE, 40(9), 1952, pp. 1098-1101.
[7] H. Kruse and A. Mukherjee, "Preprocessing Text to Improve Compression Ratios", Proc. Data Compression Conference, IEEE Computer Society Press, 1998, pp 556-557.
[8] Fred Halsall, "Multimedia Communications." Second Edition, 2002, pp. 116-120.
[9] Horowitz, Sahni, Rajasekaran, "Fundamentals of Computer algorithms," Edition 2003-04, pp. 18

Downloads

Published

2011-04-01

How to Cite

Akhtar, N., Rashid, M., Islam, S., Kashem, M. A., & Kolybanov, C. Y. (2011). Position index preserving compression of text data. Journal of Computer Science and Technology, 11(01), p. 9–14. Retrieved from https://journal.info.unlp.edu.ar/JCST/article/view/682

Issue

Section

Original Articles