A Coding Theorem Connected on R-Norm Entropy
Satish Kumar, Arun Choudhary
Abstract
Satish Kumar, Arun Choudhary
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. Mathematics Subject Classification: 94A15, 94A17, 94A24, 26D15
OpenAlex reports 1 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. Mathematics Subject Classification: 94A15, 94A17, 94A24, 26D15
Key concepts: Shannon's source coding theorem, Entropy power inequality, Mathematics, Rényi entropy, Information theory, Entropy (arrow of time), Min entropy, Discrete mathematics