Efficient Data Compressing Technique for Wireless Networks

Abstract

Data compression, also known as source coding, is a way that can be defined as not to reduce data quality but to make it shorter in quantity. In short, it is a way of expressing a message with fewer bits that can also be easily recovered or reconstruct on receiving end with no ambiguity. There are two ways of data compression, lossless compression and lossy compression with their several sub-categories like Huffman Coding, Arithmetic Coding, Run Length Encoder, Lempel–Ziv Welch (LZW), Burrows Wheeler transform, Move to Front transform and so many more which are going to be discussed in much detail in this paper. Each has its own specific advantages and disadvantages based on which each has its own suitability in various applications.