A Coding Theorem on Havrda-Charvat and Tsallis's Entropy
Satish Kumar, Arvind Kumar
Abstract
Satish Kumar, Arvind Kumar
Abstract
A relation between Shannon entropy and Kerridge inaccuracy, which is known as Shannon inequality, is well known in information theory. In this communication, first we generalized Shannon inequality and then given its application in coding theory.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A relation between Shannon entropy and Kerridge inaccuracy, which is known as Shannon inequality, is well known in information theory. In this communication, first we generalized Shannon inequality and then given its application in coding theory.
Key concepts: Shannon's source coding theorem, Entropy power inequality, Mathematics, Information theory, Rényi entropy, Tsallis entropy, Information diagram, Entropy (arrow of time)