Some coding theorems for nonadditive generalized mean-value entropies (Q417256)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some coding theorems for nonadditive generalized mean-value entropies |
scientific article; zbMATH DE number 6034280
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some coding theorems for nonadditive generalized mean-value entropies |
scientific article; zbMATH DE number 6034280 |
Statements
Some coding theorems for nonadditive generalized mean-value entropies (English)
0 references
14 May 2012
0 references
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.
0 references
0.8756815791130066
0 references
0.8406272530555725
0 references
0.8380898237228394
0 references
0.834809422492981
0 references
