Optimal universal coding with respect to the maximal individual relative redundancy criterion (Q2388474)
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 2205210
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal universal coding with respect to the maximal individual relative redundancy criterion |
scientific article; zbMATH DE number 2205210 |
Statements
Optimal universal coding with respect to the maximal individual relative redundancy criterion (English)
0 references
14 September 2005
0 references
In this paper, methods of optimal constructions of fixed-to-variable length and variable-to-fixed length codes universal with respect to the criteria of maximal individual relative redundancy for the same source sets, for many classes of stationary sources are proposed, and their properties are studied. In particular, simple bounds for this redundancy are obtained. It is shown that for the set of binary memoryless sources, if the number of encoded messages is the same then variable-to-fixed length codes are more efficient than fixed-to-variable length codes.
0 references
noiseless coding
0 references
criterion of maximal individual relative redundancy
0 references
optimal universal coding
0 references
FV and VF codes
0 references
0.8799692392349243
0 references
0.8556521534919739
0 references
0.8464570641517639
0 references
