Design and analysis of dynamic Huffman codes
Journal of the ACM (JACM)
Efficient decoding of prefix codes
Communications of the ACM
Introduction to data compression
Introduction to data compression
The Context Trees of Block Sorting Compression
DCC '98 Proceedings of the Conference on Data Compression
Low state complexity block codes via convolutional codes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
A number of data compression techniques have been introduced to reduce the text/data storage and transmission costs. The Proposed compression method in this paper is based on Switching code data compression technique using adaptive Huffman coding. The encoding process of the system encodes frequently occurring characters with shorter bit code and infrequently occurring appearing characters with longer bit codes, same code can be use for three symbols for alphabet, number and special character. The decoding process expands the encoded data back to the original data and works very much like the encoder process. Proposed method is more effective than Adaptive Huffman coding because it reduce the codeword length of the characters and can be use same codeword for three different groups character. Their size of the symbol-codeword table is also reduces which transmitted with the compressed data. This process enhancing compression efficiency up to 12% more then Adaptive Huffman Coding which provide compression ratio up to 52.51%(+12%). The developed system is very effective for compressing text file, which hold numbers and special symbols approximately equi-probable to alphabets like Math's Books/database files in a real time environment.