A Joint Representation of Rényi’s and Tsalli’s Entropy with Application in Coding Theory

Litegebe Wondie and Satish Kumar

International Journal of Mathematics and Mathematical Sciences, 2017, vol. 2017, 1-5

Abstract:

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.

Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2017/2683293.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2017/2683293.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:2683293

DOI: 10.1155/2017/2683293

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().