HIGHLIGHTS
- who: Internat. J. Math. and collaborators from the Department of Mathematics Maharshi Dayanand University, India have published the Article: ON CODING THEOREM CONNECTED WITH, in the Journal: (JOURNAL)
SUMMARY
In this communication two generalizations of_(1.4) have been studied and then the bounds for these generalizations are obtained in terms of `useful` entropy of type which is given by n (m,u) uiPi (21-s-i) (p-l-l)] > under the condition -g. n i l u. TWO GENERALIZATIONS OF `USEFUL` MEAN LENGTH AND THE CODING THEOREMS. Let us introduce the measure . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.