Answers are grounded in this paper and cite their sources.
A simple algorithm is developed for mapping the outputs of a source into the set of code sequences generated by a tree code. The algorithm is analyzed for a special case in which the source produces discrete independent equiprobable letters, and the distortion measure satisfies a symmetry condition. LettingRbe the code rate andD^{}be the minimum average distortion for that rate as given by Shannon's rate-distortion theorem, we show that the algorithm is capable of achieving average distortion as close toD^{}as desired. Furthermore an upper bound is developed on the average amount of computation for the algorithm. Asymptotically as the average distortion<d>approaches the theoretical limitD^{}, the bound on average computation has the formexp [a/ √{<d> - D^{} }]for some constanta.
No takes yet. Share an insight, caveat, or question.
Robert G. Gallager (1974) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: