Analysis of Data Compression Techniques using Huffman Coding and Arithmetic Coding
The aim of multimedia data compression is the process of saving storage space or packing more data into the same size space. Data compression involves not only compression techniques can work on different type of digital data, such as character or byte in data file or whatever. Huffman Coding is a statistical data compression technique, which gives the reduction in the average code length used to represent the symbols of an alphabet. It is a Method for the Construction of Minimum Redundancy Codes. Arithmetic coding completely bypasses the idea of replacing an input symbol with a specific code. Instead, it takes a stream of input symbols and replaces it with a single floating point output number. I consider a sample data and compare that data compression with the mentioned two methods. Keywords Compression, Digital data, input symbols, and minimum redundancy