By Topic

Construction of minimum-redundance codes with an optimum synchronizing property

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)

A simple method has been found for constructing a minimum-redundancy code having the shortest possible synchronizing sequence. For most variable-length codes the propagation of an error is halted by the next appearance of certain naturally occurring synchronizing sequences. Although the time between error and resynchronization has no upper bound, the length r of the shortest resynchronizing sequence is a useful measure of its expected value. Since a finite set of messages with specified probabilities can usually be matched with maximum efficiency by many codes having widely different values of r , a nonexhaustive method for finding a code with minimum r is of interest. The method presented is valid for a class of message sets that includes, among those discussed in the literature, the set of English letters, and two listings of roughly 5000 English words.

Published in:

Information Theory, IEEE Transactions on  (Volume:17 ,  Issue: 4 )