On a coding theorem connected with entropy of order \(\alpha\) and type \(\beta\) (Q1069903)
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: On a coding theorem connected with entropy of order \(\alpha\) and type \(\beta\) |
scientific article; zbMATH DE number 3932937
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a coding theorem connected with entropy of order \(\alpha\) and type \(\beta\) |
scientific article; zbMATH DE number 3932937 |
Statements
On a coding theorem connected with entropy of order \(\alpha\) and type \(\beta\) (English)
0 references
1983
0 references
The author presents two generalizations of the well-known Shannon inequality and gives some applications to coding theory concerning inequalities for some generalized average length of code words.
0 references
generalizations of Shannon's inequality
0 references
Shannon-entropy
0 references
Renyi-entropy
0 references
inaccuracies
0 references
entropy of order alpha and type beta
0 references
uniquely decipherable codes
0 references
average length of code words
0 references
