Survey of Lossless Data Compression Algorithms

  • Himali Patel
  • Unnati Itwala
  • et al.
N/ACitations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

The main goal of data compression is to decrease redundancy in warehouse or communicated data, so growing effective data density. It is a common necessary for most of the applications. Data compression is very important relevancy in the area of file storage and distributed system just because of in distributed system data have to send from and to all system. Two configuration of data compression are there "lossy" and "lossless". But in this paper we only focus on Lossless data compression techniques. In lossless data compression, the wholeness of data is preserved. Data compression is a technique that decreases the data size, removing the extreme information. Data compression has many types of techniques that decrease redundancy. The methods which mentioned are Run Length Encoding, Shannon Fanon, Huffman, Arithmetic, adaptive Huffman, LZ77, LZ78 and LZW with its performance.

Cite

CITATION STYLE

APA

Himali Patel, Unnati Itwala, Roshni Rana, & Kruti Dangarwala. (2015). Survey of Lossless Data Compression Algorithms. International Journal of Engineering Research And, V4(04). https://doi.org/10.17577/ijertv4is040926

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free