Some inequalities in information theory using Tsallis entropy
From MaRDI portal
Publication:1751312
DOI10.1155/2018/2861612zbMath1387.94054OpenAlexW2795474907MaRDI QIDQ1751312
Publication date: 25 May 2018
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/2861612
Cites Work
- A Mathematical Theory of Communication
- On a coding theorem connected with entropy of order \(\alpha\) and type \(\beta\)
- A joint representation of Rényi's and Tsalli's entropy with application in coding theory
- Possible generalization of Boltzmann-Gibbs statistics.
- A Noiseless Coding Theorem for Sources Having Utilities
- Variable-length source coding with a cost depending only on the code word length
- A coding theorem and Rényi's entropy
- Buffer overflow in variable length coding of fixed rate sources
- Generalized information functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Some inequalities in information theory using Tsallis entropy