International Journal of Mathematics and Mathematical Sciences
Volume 12 (1989), Issue 1, Pages 193-198
On coding theorem connected with ‘useful’ entropy of order-
Department of Mathematics, Maharshi Dayanand University, Rohtak 124001, India
Received 31 July 1986
Copyright © 1989 Priti Jain and R. K. Tuteja. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Guiasu and Picard  introduced the mean length for ‘useful’ codes. They
called this length as the ‘useful’ mean length. Longo  has proved a noiseless
coding theorem for this ‘useful’ mean length. In this paper we will give two
generalizations of ‘useful’ mean length. After then the noiseless coding theorems are
proved using these two generalizations.