By Topic

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

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

1 Author(s)

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.

Published in:

Information Theory, IEEE Transactions on  (Volume:22 ,  Issue: 1 )