African Journal of
Mathematics and Computer Science Research

  • Abbreviation: Afr. J. Math. Comput. Sci. Res.
  • Language: English
  • ISSN: 2006-9731
  • DOI: 10.5897/AJMCSR
  • Start Year: 2008
  • Published Articles: 259

Full Length Research Paper

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

Priti Gupta1, Niranjan1 and Hari Arora2*
  1Department of Statistics, Maharishi Dayanand University (M. D. U), Rohtak, India. 2Department of Mathematics, Amity University, Noida, India.
Email: [email protected]

  •  Accepted: 23 December 2010
  •  Published: 31 March 2011



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.