A joint representation of Rényi's and Tsalli's entropy with application in coding theory (Q1751509)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6873338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A joint representation of Rényi's and Tsalli's entropy with application in coding theory |
scientific article; zbMATH DE number 6873338 |
Statements
A joint representation of Rényi's and Tsalli's entropy with application in coding theory (English)
0 references
25 May 2018
0 references
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.
0 references
0.8349589109420776
0 references
0.8345484733581543
0 references
0.8339216113090515
0 references
0.8207005262374878
0 references
