On the computation of rate-distortion functions (Corresp.)

In a recent paper [1], Blahut suggested an efficient algorithm for computing rate-distortion functions. In this correspondence we show that the sequence of distributions used in that algorithm has a limit yielding a point on the curve if the reproducing alphabet is finite, and we obtain a similar but weaker result for countable reproducing alphabets.