CFP last date
20 January 2025
Reseach Article

Comparative Study of Data Compression Techniques

by Anshul Anup Rajput, Ravi Ashok Rajput, Pooja Raundale
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 178 - Number 28
Year of Publication: 2019
Authors: Anshul Anup Rajput, Ravi Ashok Rajput, Pooja Raundale
10.5120/ijca2019919104

Anshul Anup Rajput, Ravi Ashok Rajput, Pooja Raundale . Comparative Study of Data Compression Techniques. International Journal of Computer Applications. 178, 28 ( Jun 2019), 15-19. DOI=10.5120/ijca2019919104

@article{ 10.5120/ijca2019919104,
author = { Anshul Anup Rajput, Ravi Ashok Rajput, Pooja Raundale },
title = { Comparative Study of Data Compression Techniques },
journal = { International Journal of Computer Applications },
issue_date = { Jun 2019 },
volume = { 178 },
number = { 28 },
month = { Jun },
year = { 2019 },
issn = { 0975-8887 },
pages = { 15-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume178/number28/30713-2019919104/ },
doi = { 10.5120/ijca2019919104 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:51:40.761475+05:30
%A Anshul Anup Rajput
%A Ravi Ashok Rajput
%A Pooja Raundale
%T Comparative Study of Data Compression Techniques
%J International Journal of Computer Applications
%@ 0975-8887
%V 178
%N 28
%P 15-19
%D 2019
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This document discusses data compression and some of the data compression techniques. Data Compression is a technique of reducing the amount of space data occupies, to ease the process of storage and communication. This involves but is not limited to interpretation and elimination of redundancy in data. The fundamental process of compression involves using a well drafted technique to convert the actual data into the compressed data (smaller size). Depending upon how well a compression technique works and how much data can be regenerated from the compressed data given by a certain technique, the technique is classified as either as a lossy data compression technique or lossless data compression technique.

References
  1. Dea Ayu Rachesti, Tito Waluyo Purboyo, Anggunmeka Luhur Prasasti, “Comparison of Text Data Compression Using Huffman, Shannon-Fano, Run Length Encoding” , Lecturer, Faculty of Electrical Engineering, Telkom University, Bandung, Indonesia.
  2. M R Hasan , M I Ibrahimy , S M A Motakabber , M M Ferdaus and M N H Khan, Comparative data compression techniques and multi compression results, Dept. of Electrical and Computer Engineering, International Islamic University Malaysia, Gombak, Malaysia.
  3. S.R. KODITUWAKKU, U. S.AMARASINGHE, COMPARISON OF LOSSLESS DATA COMPRESSION ALGORITHMS FOR TEXT DATA, Department of Statistics & Computer Science, University of Peradeniya, Sri Lanka.
  4. Arup Kumar Bhattacharjee ,Tanumon Bej, Saheb Agarwal, Comparison Study of Lossless Data Compression Algorithms for Text Data, Comparison Study of Lossless Data Compression Algorithms for Text Data.
  5. Data compression using dynamic Markov modeling, Cormak, V. and S. Horspool, 1987. Comput. J., 30: 541–550
  6. Mohammad Hosseini, “A Survey of Data Compression Algorithms and their Applications”, Applications of Advanced Algorithms, At Simon Fraser University, Canada, January 2012
  7. Blelloch, E., 2002. Introduction to Data Compression, Computer Science Department, Carnegie Mellon University.
Index Terms

Computer Science
Information Sciences

Keywords

Data Compression Lossless Data Compression.