By Topic

An algorithm for optimal prefix parsing of a noiseless and memoryless channel

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

3 Author(s)

We discuss the prefix encoding of aQ-ary source(Q geq 2)into anL-symbol channel alphabet withL geq Q. We present an optimal encoding scheme that minimizes the expected cost per symbol in the case of equally probable source symbols and arbitrary channel symbol costs.

Published in:

Information Theory, IEEE Transactions on  (Volume:19 ,  Issue: 2 )