Some coding theorems for nonadditive generalized mean-value entropies

DOI10.1155/2012/315686MaRDI QIDQ417256zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Satish Kumar, Gurdas Ram, Vishal Gupta

Publication date 14 May 2012

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2012/315686

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Source coding (94A29)

Review text

Summary: We give an optimality characterization of non-additive generalized mean-value entropies from suitable non-additive and generalized mean-value properties of the measure of average length. The results obtained cover many results obtained by other authors as particular cases, as well as the ordinary length due to Shannon 1948. The main instrument is the \(l(n_i)\) function of the word lengths in obtaining the average length of the code.

Recommendations

• Publication:3495034
• Coding theorems on a non-additive generalized entropy of Havrda-Charvat and Tsallis
• Some coding theorem on generalized Havrda-Charvat and Tsallis's entropy
• On a generalized entropy and a coding theorem
• On Noiseless Coding

Cites work

• A coding theorem and Rényi's entropy
• A Mathematical Theory of Communication
• Definition of entropy by means of a coding problem
• scientific article; zbMATH DE number 3135403 (Why is no real title available?)
• Some more results on R-norm information measure

Cited in

(7)

• Coding theorems on a non-additive generalized entropy of Havrda-Charvat and Tsallis
• scientific article; zbMATH DE number 4168384 (Why is no real title available?)
• scientific article; zbMATH DE number 3920365 (Why is no real title available?)
• scientific article; zbMATH DE number 1264950 (Why is no real title available?)
• Information and Coding Discrimination of Pseudo-Additive Entropies (PAE)
• On a generalized entropy and a coding theorem
• Source coding theorem based on a nonadditive information content

This page was built for publication: Some coding theorems for nonadditive generalized mean-value entropies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417256)