Coding Theorems on a Non-Additive Generalized Entropy of Havrda-Charvat And Tsallis
2012
A new measure L , called average code word length of order and type is defined and its relationship with a generalized information measure of order and type is discussed. Using L , some coding theorems are proved.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
15
References
1
Citations
NaN
KQI