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...

Full description

Bibliographic Details
Main Authors: Litegebe Wondie, Satish Kumar
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
id doaj-cda5c3ba129f42e088b141146e0f3525
record_format Article
spelling doaj-cda5c3ba129f42e088b141146e0f35252020-11-24T22:46:00ZengHindawi LimitedInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04252017-01-01201710.1155/2017/26832932683293A Joint Representation of Rényi’s and Tsalli’s Entropy with Application in Coding TheoryLitegebe Wondie0Satish Kumar1Department of Mathematics, College of Natural and Computational Science, University of Gondar, Gondar, EthiopiaDepartment of Mathematics, College of Natural and Computational Science, University of Gondar, Gondar, EthiopiaWe 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.http://dx.doi.org/10.1155/2017/2683293
collection DOAJ
language English
format Article
sources DOAJ
author Litegebe Wondie
Satish Kumar
spellingShingle Litegebe Wondie
Satish Kumar
A Joint Representation of Rényi’s and Tsalli’s Entropy with Application in Coding Theory
International Journal of Mathematics and Mathematical Sciences
author_facet Litegebe Wondie
Satish Kumar
author_sort Litegebe Wondie
title A Joint Representation of Rényi’s and Tsalli’s Entropy with Application in Coding Theory
title_short A Joint Representation of Rényi’s and Tsalli’s Entropy with Application in Coding Theory
title_full A Joint Representation of Rényi’s and Tsalli’s Entropy with Application in Coding Theory
title_fullStr A Joint Representation of Rényi’s and Tsalli’s Entropy with Application in Coding Theory
title_full_unstemmed A Joint Representation of Rényi’s and Tsalli’s Entropy with Application in Coding Theory
title_sort joint representation of rényi’s and tsalli’s entropy with application in coding theory
publisher Hindawi Limited
series International Journal of Mathematics and Mathematical Sciences
issn 0161-1712
1687-0425
publishDate 2017-01-01
description 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.
url http://dx.doi.org/10.1155/2017/2683293
work_keys_str_mv AT litegebewondie ajointrepresentationofrenyisandtsallisentropywithapplicationincodingtheory
AT satishkumar ajointrepresentationofrenyisandtsallisentropywithapplicationincodingtheory
AT litegebewondie jointrepresentationofrenyisandtsallisentropywithapplicationincodingtheory
AT satishkumar jointrepresentationofrenyisandtsallisentropywithapplicationincodingtheory
_version_ 1725686723689578496