By Topic

On Universal Codeword Sets

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)

The set of all binary strings terminated by a specific pattern is countably infinite and regular and satisfies the prefix property. Some properties of such codeword sets in the context of source coding are studied. It is shown that some of them are universal and some of them are not, but none is asymptotically optimal.

Published in:

Information Theory, IEEE Transactions on  (Volume:27 ,  Issue: 5 )