A Huffman Codes Based Approach to Achieve Minimum Redundancy

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, where PN is the least likely source letter probability. But we decreased the redundancy of source letter (N) to four and five.