An Efficient Compression Algorithm (ECA) for Text Data

Data compression algorithms are used to reduce the redundancy and storage requirement for data. Data compression is also an efficient approach to reduce communication costs by using available bandwidth effectively. Over the last decade we have seen an unprecedented explosion in the amount of digital data transmitted via the Internet in the form of text, images, video, sound, computer programs, etc. If this trend expected to continue, then it will be necessary to develop a compression algorithm that can most effectively use available network bandwidth by compressing the data at maximum level. Along with this it will also important to consider the security aspects of the compressed data transmitting over Internet, as most of the text data transmitted over the Internet is very much vulnerable to an attack. So, we are presenting an intelligent, reversible transformation technique that can be applied to source text that improve algorithm ability to compress and also offer a sufficient level of security to the transmitted data.

[1]  Amar Mukherjee,et al.  Network conscious text compression system (NCTCSys) , 2001, Proceedings International Conference on Information Technology: Coding and Computing.

[2]  Amar Mukherjee,et al.  Data compression using encrypted text , 1996, Proceedings of Data Compression Conference - DCC '96.

[3]  Amar Mukherjee,et al.  Data compression using text encryption , 1997, Proceedings DCC '97. Data Compression Conference.

[4]  Amar Mukherjee,et al.  LIPT: A Reversible Lossless Text Transform to Improve Compression Performance , 2001, Data Compression Conference.

[5]  A. Mukherjee,et al.  Preprocessing text to improve compression ratios , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

[6]  Alistair Moffat,et al.  Implementing the PPM data compression scheme , 1990, IEEE Trans. Commun..

[7]  Amar Mukherjee,et al.  LIPT: a lossless text transform to improve compression , 2001, Proceedings International Conference on Information Technology: Coding and Computing.

[8]  Terry A. Welch,et al.  A Technique for High-Performance Data Compression , 1984, Computer.

[9]  N. Jesper Larsson,et al.  The context trees of block sorting compression , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

[10]  D. J. Wheeler,et al.  A Block-sorting Lossless Data Compression Algorithm , 1994 .