On variable length coding with side information for discrete memoryless sources (Q1101411)
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 4047593
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On variable length coding with side information for discrete memoryless sources |
scientific article; zbMATH DE number 4047593 |
Statements
On variable length coding with side information for discrete memoryless sources (English)
0 references
1987
0 references
In this paper we consider the zero error variable length coding problem for discrete memoryless sources with side information at the decoder only. Using concepts of graph theory, we obtain a characterization of the minimum achievable rate r for this coding problem. Furthermore, computable upper and lower bounds for the minimum achievable rate r is given and a condition under which the upper and lower bounds are equal is found. Finally, this result is applied to some examples in which the minimum achievable rate r can be evaluated.
0 references
zero error variable length coding
0 references
discrete memoryless sources
0 references
side information at the decoder
0 references
minimum achievable rate
0 references
0.8392333984375
0 references
0.8033814430236816
0 references
0.7969611287117004
0 references
0.796747624874115
0 references
0.7965632081031799
0 references
