On a coding theorem connected with ‘useful’ entropy of order $\alpha$ and type $\beta$
Kybernetika, Tome 23 (1987) no. 5, pp. 420-427
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
@article{KYB_1987_23_5_a7,
author = {Jain, Priti and Tuteja, R. K.},
title = {On a coding theorem connected with {\textquoteleft}useful{\textquoteright} entropy of order $\alpha$ and type $\beta$},
journal = {Kybernetika},
pages = {420--427},
year = {1987},
volume = {23},
number = {5},
mrnumber = {915693},
zbl = {0637.94005},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_1987_23_5_a7/}
}
Jain, Priti; Tuteja, R. K. On a coding theorem connected with ‘useful’ entropy of order $\alpha$ and type $\beta$. Kybernetika, Tome 23 (1987) no. 5, pp. 420-427. http://geodesic.mathdoc.fr/item/KYB_1987_23_5_a7/
[1] M. Belis, S. Guiasu: A quantitative-qualitative measure of information in cybernetic systems. IEEE Trans. Inform. Theory 14 (1968), 593-594.
[2] S. Guiasu, C. F. Picard: Borne inferieure de la longueur utile de certains codes. C.R. Acad. Sci. Paris 273 (1971), 248-251. | MR | Zbl
[3] G. Longo: A noiseless coding theorem for source having utilities. SIAM J. Appl. Math. 30 (1971), 4, 739-748. | MR
[4] C. F. Picard: Weighted probabilistic information measures. J. Combin. Inform. System Sci. 4(1979), 4, 343-356. | MR | Zbl