By Topic

On tree coding with a fidelity criterion

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

This paper reexamines Jelinek's proof that tree codes can be used to approach the rate-distortion bound. It is shown that the branching process used in Jelinek's proof is not a (strict-sense) branching process (SSBP) when the source is asymmetric. Branching processes with random environments (BPWRE) are introduced and used to extend the proof to general discrete-time memoryless sources. The theory developed indicates why a particular metric used in experiments performed better than another suggested by the original proof.

Published in:

Information Theory, IEEE Transactions on  (Volume:21 ,  Issue: 4 )