Title :
A Huffman Codes Based Approach to Achieve Minimum Redundancy
Author :
Bhullar, J.S. ; Sandhu, Parvinder S. ; Gupta, Manish
Author_Institution :
Deptt. Of Appl. Sci., MIMIT, Malout, India
Abstract :
In this paper we had introduced more tighter bounds by decreasing the redundancy of source letter. Previously the sharper bounds were found if the number of source letter was large and also provided the redundancy `r´ of any discrete memory less source satisfied r¿1-H(PN), where PN is the least likely source letter probability. But we decreased the redundancy of source letter (N) to four and five.
Keywords :
Huffman codes; redundancy; Huffman codes; discrete memory; minimum redundancy; source letter probability; Binary codes; Computational modeling; Computer simulation; Educational institutions; Entropy; Upper bound; component; formatting; insert; style; styling;
Conference_Titel :
Computer Modeling and Simulation, 2010. ICCMS '10. Second International Conference on
Conference_Location :
Sanya, Hainan
Print_ISBN :
978-1-4244-5642-0
Electronic_ISBN :
978-1-4244-5643-7
DOI :
10.1109/ICCMS.2010.177
