On variable length coding with side information for discrete memoryless sources (Q1101411)

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.