By Topic

Variable-length encoding of fixed-rate Markov sources for fixed-rate channels

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)

The problem of buffer overflow in variable-length-to-block and block-to-variable-length coding of fixed-rate finite-state homogeneous Markov sources for transmission through fixed:rate noiseless channels is investigated. Asymptotically optimal converging upper and lower bounds on the probability of overflow are derived. They decrease exponentially with the buffer size B . The least rates R(\gamma ) that achieve exponents \gamma for both coding methods are obtained, as are the corresponding optimal word assignments. It is shown that for the class of state-calculable sources, variable-length-to-block and block-to-variable-length rates R(\gamma ) are equal.

Published in:

Information Theory, IEEE Transactions on  (Volume:20 ,  Issue: 6 )