Some coding theorem connected on generalized Renyi's entropy for incomplete power probability distribution \(p^\beta\) (Q5744975)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6540780
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some coding theorem connected on generalized Renyi's entropy for incomplete power probability distribution \(p^\beta\) |
scientific article; zbMATH DE number 6540780 |
Statements
Some Coding Theorem Connected on Generalized Renyi's Entropy for Incomplete Power Probability Distribution \(p^{\beta}\) (English)
0 references
10 February 2016
0 references
Renyi's entropy
0 references
codeword length
0 references
Kraft inequality
0 references
optimal code length and power probabilities
0 references
0.888370931148529
0 references
0.8793520927429199
0 references
0.8756510019302368
0 references
0.8658706545829773
0 references
0.8602577447891235
0 references
