The desirable synchronization properties of T-codes have been well document
ed ever since they were first reported [Titchener 1984]. A theoretical meth
od for calculating average synchronization delays (ASD) for T-codes has bee
n proposed by Higgie [Higgie 1992]. However, computational efficiency of th
at algorithm is not optimal, notably when suffix conditions are encountered
during the decoding process. This paper presents an improvement on that al
gorithm. With the new method, computational efficiency is improved by reduc
ing the average time required per code set. It produces ASD values in less
than one quarter of the time required by the original method to generate co
mparable results. (C) 1999 Elsevier Science Ltd. Ail rights reserved.