article
Exponential Renyi’s entropy of ‘Type (a, ß)’ and new mean code-Word length
International Journal of Statistics and Applied Mathematics · 2017 · Vol. 2(1) · pp. 08–13
Abstract
In this paper, we introduce a quantity which is called exponential entropy of ‘type (a, s) ’ and discuss its some major properties corresponding to exponential entropy of concave function. Further, a new measure Las (A) called average codeword length of ‘type (a, s) ’ has been define and its relationship with a result of an exponential Reyni’s entropy of ‘type (a, s)’ has been discussed. Using Las (A) and Lsa (A) , coding theorem for discrete noiseless has been proved. At the end of the paper, we illustrate the veracity of the theorem by taking empirical data as given in the table 3.1 and 3.2.
Advanced Statistical Methods and ModelsFuzzy Systems and OptimizationMulti-Criteria Decision MakingCode wordMathematicsExponential functionMin entropyEntropy (arrow of time)Rényi entropyMaximum entropy probability distributionExponential typeShannon's source coding theoremDiscrete mathematics
Citations
0
FWCI
0.00
field-weighted impact
References
0
Percentile
13%
vs. same field & year
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.