By Topic

Reinforced prefixed comma-free codes

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)

Signal flow graph methods are applied to the problem of counting the number of allowable code words for certain classes of prefixed comma-free codes. This method can be applied whenever the distance between the prefix and otherA-tuples in the code word is a prescribed function of the position of theA-tuple. Such codes can have desirable synchronization properties without leading to very small code word sets.

Published in:

Information Theory, IEEE Transactions on  (Volume:13 ,  Issue: 3 )