@inproceedings{7e2af792a6754a40bdd11d769863169a,
title = "Performance comparison of Huffman Coding and Double Huffman Coding",
abstract = "Huffman coding [11] is a most popular technique for generating prefix-free codes [7, 10]. It is an efficient algorithm in the field of source coding. It produces the lowest possible number of code symbols of a single source symbol [1]. Huffman coding is a most widely used lossless compression technique [2]. However, there are some limitations that arise in Huffman coding [20, 21]. This method produces a code of few bits for a symbol having high probability of occurrence and large number of bits for a symbol having low probability of occurrence [3]. Instead of this, in Double Huffman Coding when the code word of the symbol has been generated it will be compressed on binary basis. Through this technique a better result be achieved. In this paper we discussed the technique of Huffman Coding and Double Huffman coding and compare their performance analysis.",
keywords = "Compression, Entropy, Huffman Coding, Huffman Tree, Redundancy",
author = "Rabia Arshad and Adeel Saleem and Danista Khan",
note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 6th International Conference on Innovative Computing Technology, INTECH 2016 ; Conference date: 24-08-2016 Through 26-08-2016",
year = "2017",
month = feb,
day = "6",
doi = "10.1109/INTECH.2016.7845058",
language = "English",
series = "2016 6th International Conference on Innovative Computing Technology, INTECH 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "361--364",
booktitle = "2016 6th International Conference on Innovative Computing Technology, INTECH 2016",
}