Geodesic
Some noiseless coding theorem connected with Havrda and Charvat and Tsallis's entropy
Kragujevac Journal of Mathematics, Tome 35 (2011) no. 1, p. 111 Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Voir la notice de l'article

A new measure $L_{\alpha }^{\beta }$, called average code word length of order $\alpha $ and type $\beta $ has been defined and its relationship with a result of generalized Havrda and Charvat and Tsallis's entropy has been discussed. Using $L_{\alpha }^{\beta }$, some coding theorem for discrete noiseless channel has been proved.
Classification : 94A15 94A17 94A24 26D15
Keywords: Tsallis's Entropy, Codeword length, Kraft inequality and Optimal code length and Power probabilities 
@article{KJM_2011_35_1_a8,
     author = {Satish Kumar and Rajesh Kumar},
     title = {Some noiseless coding theorem connected with {Havrda} and {Charvat} and {Tsallis's} entropy},
     journal = {Kragujevac Journal of Mathematics},
     pages = {111 },
     year = {2011},
     volume = {35},
     number = {1},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KJM_2011_35_1_a8/}
}
TY  - JOUR
AU  - Satish Kumar
AU  - Rajesh Kumar
TI  - Some noiseless coding theorem connected with Havrda and Charvat and Tsallis's entropy
JO  - Kragujevac Journal of Mathematics
PY  - 2011
SP  - 111 
VL  - 35
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/KJM_2011_35_1_a8/
LA  - en
ID  - KJM_2011_35_1_a8
ER  - 
%0 Journal Article
%A Satish Kumar
%A Rajesh Kumar
%T Some noiseless coding theorem connected with Havrda and Charvat and Tsallis's entropy
%J Kragujevac Journal of Mathematics
%D 2011
%P 111 
%V 35
%N 1
%U http://geodesic.mathdoc.fr/item/KJM_2011_35_1_a8/
%G en
%F KJM_2011_35_1_a8
Satish Kumar; Rajesh Kumar. Some noiseless coding theorem connected with Havrda and Charvat and Tsallis's entropy. Kragujevac Journal of Mathematics, Tome 35 (2011) no. 1, p. 111 . http://geodesic.mathdoc.fr/item/KJM_2011_35_1_a8/