2013Unpublished venueRequires access

Sharma-Mittal Entropy and Coding Theorem

Satish Kumar, Arun Choudhary

Open publisher page 0 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 and discuss some particular cases.

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 and discuss some particular cases.

Why it matters

A significance statement is not available in the OpenAlex record.

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 and discuss some particular cases.

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Sharma-Mittal Entropy and Coding Theorem — Research Paper | ScholarLens