Abstract

In coding theory, generally, we come across the problem of efficient coding of messages to be sent over a noiseless channel and attempt to maximize the number of messages that can be sent through a channel in a given time. Therefore, we find the minimum value of a mean codeword length subject to a given constraint on codeword lengths. As the codeword lengths are integers, the minimum value lies between two bounds, so, a noiseless coding theorem seeks to find these bounds for a given mean and a given constraint. In this paper, we are modifying the noiseless coding theorem as obtained by Bilal and Pirzada (2006) for binary, as well as D size 1:1 codes. The coding theorem as obtained by us is less constrained.

Key words: Quantitative-qualitative measure, inaccuracy, noiseless coding theorem.