Journal of applied mathematics & informatics

  • 제5권1호
  • /
  • Pages.201-212
  • /
  • 1998
  • /
  • 2734-1194(pISSN)
  • /
  • 2234-8417(eISSN)
한국전산응용수학회 (The Korean Society for Computational and Applied Mathematics)
권호 표지

${L_{1:1}}^\beta$(t) IN TERMS OF A GENERALIZED MEASURE OF ENTROPY

  • Hooda, D.S. (Department of Mathematics and Statistics CCS Haryana Agricultural University) ;
  • Ram, Anant (Govt. HIGH School)
  • 발행 : 1998.03.01

⟨ 이전 논문 다음 논문 ⟩

초록

In the present paper we define the codes which assign D-alphabet one-one codeword to each outcome of a random variable and the functions which represent possible transormations from one-one codes of size D to suitable codes. By using these functions we obtain lower bounds on the exponentiated mean codeword length for one-one codes in terms of the generalized entropy of order $\alpha$ and type $\beta$ and study the particular cases also.

키워드

참고문헌

  1. Variational and Quasi Variational Inequalities C.Baiocchi;A.Capelo
  2. Pub. Math. v.10 Uber ver aligemeinerte quasilineare Mittelwerte die nut Gewichts funktionen gebildet sind Aczal,J.;Z.Daroozy
  3. J. Appl. Prob. v.12 Inaccuracy and coding theorem Avtar,R.;R.S.Soni
  4. A coding theorem and Renyi's entropy, Information and Control v.8 Campbell,L.L.
  5. International Jr. of Management and Systems v.8 A profile on noiseless coding theorems Hooda,D.S.;U.S.Bhaker
  6. Bounds on exponential mean codeword length of size D-alphabet 1:1 code Hooda,D.S.
  7. Buffer overflow in variable lengths coding of fixed rate sources v.Ⅱ;3 no.14 Jelinek,F.
  8. Math Seminar v.4 Generalized entropy of order α and type β Kapur,J.N.
  9. Information and Control v.41 Variable length source coding with a cost depending only on the code-word length Kieffer,J.C.
  10. Some equivalence between shannon entropy and kolmogrov complexity v.1T 24 no.3 Leung-Yan-Cheong, S. K.;T.M.Cover