%0 Journal Article
%T An Improved Decoding Technique for Efficient Huffman Coding
%A Jamil As-ad
%A Lutfun Nahar
%A Mohibur Rahaman
%A Rashed Mustafa
%A Zinnia Sultana
%J Journal of Computer Science Applications | Computer Science Impact Factor Journals
%D 2017
%R http://dx.doi.org/10.15226/2474-9257/2/1/00110
%X In today¡¯s world storing numerous data or information efficiently is a significant issue because of limited storage. Every moment we need to transfer large volume of information soundly and correctly. A storage space/memory storage required to store this information is. The way of communication which is also constricted with confined communication lines. These incompetence drives to need of data compression. Compression makes a reduction in memory storage, data transmission time, communication bandwidth and the ultimate cost savings also. To compress data efficiently and effectively one of the most popular and widely used techniques is Huffman compression. It is a lossless compression technique that enables the restoration of a file to its authentic/key state, having not to loss of a single bit of data when the file is uncompressed. It will be more efficient by reducing the memory requirements for Huffman tree. This article aimed at reducing the tree size of Huffman coding and also explored a newly memory efficient technique to store Huffman tree. As a consequence we also designed an encoding and decoding algorithm. Our proposed technique is much more efficient than most of the/all other existing techniques where to represent the Huffman tree structure total memory requirements are 9n-2 bits for the worst case, average and also for the best case. The results obtained significant improvements over previous/existing work. Keywords: Tree Compression; Static Huffman Code; Data Structures; Complete Binary Tree
%U https://symbiosisonlinepublishing.com/computer-science-technology/computerscience-information-technology10.php