A Joint Representation of Rényi’s and Tsalli’s Entropy with Application in Coding Theory
We introduce a quantity which is called Rényi’s-Tsalli’s entropy of order ξ and discussed some of its major properties with Shannon and other entropies in the literature. Further, we give its application in coding theory and a coding theorem analogous to the ordinary coding theorem for a noiseless c...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2017-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/2017/2683293 |
| Summary: | We introduce a quantity which is called Rényi’s-Tsalli’s entropy of order ξ and discussed some of its major properties with Shannon and other entropies in the literature. Further, we give its application in coding theory and a coding theorem analogous to the ordinary coding theorem for a noiseless channel is proved. The theorem states that the proposed entropy is the lower bound of mean code word length. |
|---|---|
| ISSN: | 0161-1712 1687-0425 |