On best 1:1 codes for generalized quantitative-qualitative measure of inaccuracy

African Journal of Mathematics and Computer Science Research

Priti Gupta¹ 

关键词: Quantitative-qualitative measure;    inaccuracy;    noiseless coding theorem.;   

DOI  :  

学科分类：计算机科学（综合）

来源: Academic Journals

【 摘 要 】

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.

【 授权许可】

CC BY