A joint representation of Rényi's and Tsalli's entropy with application in coding theory
type: Item
instance of: scholarly article
title: A joint representation of Rényi's and Tsalli's entropy with application in coding theory
zbMATH Open document ID: 1387.94055
DOI: 10.1155/2017/2683293
author: Litegebe Wondie
author: Satish Kumar
published in: International Journal of Mathematics and Mathematical Sciences
publication date: 2018-05-25T00:00:00Z
review text: Summary: We introduce a quantity which is called Rényi's-Tsalli's entropy of order \(\xi\) 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.
Mathematics Subject Classification ID: 94A17
zbMATH DE Number: 6873338
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2017/2683293
OpenAlex ID: W2761529500
cites work: A Mathematical Theory of Communication
cites work: Q3292859
cites work: Q5564905
cites work: Possible generalization of Boltzmann-Gibbs statistics.
cites work: Entropy: a new definition and its applications
cites work: A coding theorem and Rényi's entropy
cites work: Variable-length source coding with a cost depending only on the code word length
cites work: Buffer overflow in variable length coding of fixed rate sources
cites work: Q5579680
cites work: A Method for the Construction of Minimum-Redundancy Codes
description: scientific article; zbMATH DE number 6873338