Some noiseless coding theorem connected with Havrda and Charvat and Tsallis's entropy
Kragujevac Journal of Mathematics (2011)
- Volume: 35, Issue: 35, page 111-117
- ISSN: 1450-9628
Access Full Article
top
How to cite
topSatish Kumar, and Rajesh Kumar. "Some noiseless coding theorem connected with Havrda and Charvat and Tsallis's entropy." Kragujevac Journal of Mathematics 35.35 (2011): 111-117. <http://eudml.org/doc/253289>.
@article{SatishKumar2011,
author = {Satish Kumar, Rajesh Kumar},
journal = {Kragujevac Journal of Mathematics},
keywords = {codeword length; Kraft inequality; optimal code length; power probabilities},
language = {eng},
number = {35},
pages = {111-117},
publisher = {Prirodno-matematički fakultet Kragujevac},
title = {Some noiseless coding theorem connected with Havrda and Charvat and Tsallis's entropy},
url = {http://eudml.org/doc/253289},
volume = {35},
year = {2011},
}
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
PB - Prirodno-matematički fakultet Kragujevac
VL - 35
IS - 35
SP - 111
EP - 117
LA - eng
KW - codeword length; Kraft inequality; optimal code length; power probabilities
UR - http://eudml.org/doc/253289
ER -
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.