2012IJCA Proceedings on National Workshop-Cum-Conference on Recent Trends in Mathematics and Computing 2011Requires access

A Coding Theorem on Havrda-Charvat and Tsallis's Entropy

Satish Kumar, Arvind Kumar

Open publisher page 2 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

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

Key concepts: Shannon's source coding theorem, Entropy power inequality, Mathematics, Information theory, Rényi entropy, Tsallis entropy, Information diagram, Entropy (arrow of time)

Related papers

Back to paper searchBrowse research topicsOriginal source
A Coding Theorem on Havrda-Charvat and Tsallis's Entropy — Research Paper | ScholarLens