A CODING THEOREM ON GENERALIZED R-NORM ENTROPY

  • Hooda, D.S. (Department of Math. and Statistics, CCS H.A.U.)
  • 발행 : 2001.09.01

초록

Recently, Hooda and Ram [7] have proposed and characterized a new generalized measure of R-norm entropy. In the present communication we have studied its application in coding theory. Various mean codeword lengths and their bounds have been defined and a coding theorem on lower and upper bounds of a generalized mean codeword length in term of the generalized R-norm entropy has been proved.

키워드

참고문헌

  1. Pub. Math. Debrecan v.10 Uber verallegemeineste quasiliniare mittelveste die mit grewinebts functionen gebildet Sind J.Aczel;Z.Daroczy
  2. Information and Control v.19 Information theoretical consideration on estimation problems S.Arimoto
  3. Information and Control v.45 The R-norm Information measure D.E.Boekee;J.C.A.Van Der Lubbe
  4. Information and Control v.8 A coding theorem and Renyi's entropy L.L.Campbell
  5. Information and Control v.16 Generalized information function Z.Daroczy
  6. Kybernetika v.3 Quantification of classification processes concept of structural α-entropy J.Havrda;F.Charvat
  7. Accepted for publication in Caribbean Journal of Mathematical & Computer Science v.8 Characterization of the generalized R-norm entropy D.S.Hooda;Anant Ram
  8. Soochow Journal of Math. v.23 A generalized 'Useful' information measure and coding theorems D.S.Hooda;U.S.Bhaker
  9. Buffer overflow in variable lengths coding of fixed rate sources v.3 F.Jelinek
  10. Information and Control v.41 Variable lengths source coding with a cost depending only on the codeword length J.C.Kieffer
  11. Maths Seminar v.4 Generalized entropy of order α and type β J.N.Kapur
  12. MS Thesis, Electrical Engineering Department, MIT A device for quantizing, grouping and coding amplitude modulated pulses L.G.Kraft
  13. Proc. 4th Berkeley Symp. Maths. Stat. Prob. v.1 On measure of entropy and information A.Renyi
  14. Bell System Tech., J. v.27 Mathematical theory of communication C.E.Shannon