On a coding theorem connected with ‘useful’ entropy of order and type
Kybernetika (1987)
- Volume: 23, Issue: 5, page 420-427
- ISSN: 0023-5954
Access Full Article
top
How to cite
topJain, Priti, and Tuteja, R. K.. "On a coding theorem connected with ‘useful’ entropy of order $\alpha $ and type $\beta $." Kybernetika 23.5 (1987): 420-427. <http://eudml.org/doc/29028>.
@article{Jain1987,
author = {Jain, Priti, Tuteja, R. K.},
journal = {Kybernetika},
keywords = {generalized useful mean lengths; useful entropy; memoryless source},
language = {eng},
number = {5},
pages = {420-427},
publisher = {Institute of Information Theory and Automation AS CR},
title = {On a coding theorem connected with ‘useful’ entropy of order $\alpha $ and type $\beta $},
url = {http://eudml.org/doc/29028},
volume = {23},
year = {1987},
}
TY - JOUR
AU - Jain, Priti
AU - Tuteja, R. K.
TI - On a coding theorem connected with ‘useful’ entropy of order $\alpha $ and type $\beta $
JO - Kybernetika
PY - 1987
PB - Institute of Information Theory and Automation AS CR
VL - 23
IS - 5
SP - 420
EP - 427
LA - eng
KW - generalized useful mean lengths; useful entropy; memoryless source
UR - http://eudml.org/doc/29028
ER -
References
top- M. Belis, S. Guiasu, A quantitative-qualitative measure of information in cybernetic systems, IEEE Trans. Inform. Theory 14 (1968), 593-594. (1968)
- S. Guiasu, C. F. Picard, Borne inferieure de la longueur utile de certains codes, C.R. Acad. Sci. Paris 273 (1971), 248-251. (1971) Zbl0224.94006MR0284270
- G. Longo, A noiseless coding theorem for source having utilities, SIAM J. Appl. Math. 30 (1971), 4, 739-748. (1971) MR0414232
- C. F. Picard, Weighted probabilistic information measures, J. Combin. Inform. System Sci. 4(1979), 4, 343-356. (1979) Zbl0447.94011MR0573149
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.