Asymptotic computation of certain sequential algorithms for source coding with a fidelity criterion (Corresp.)

Speeds of computation divergence as distortion tends to the rate-distortion limit are determined for three recent sequential source coding algorithms. The speeds follow from analysis and simulation; they remain unchanged for several sources and rates. The stack algorithm is most efficient in terms of nodes extended per encoder output digit.