A synchronizable (SC_{s}) code has the property that the punctuation (comma or no comma, comma indicating that the next symbol is the beginning of a new code word) at a given position in a code symbol stream can always be determined by observing at most s code symbols in the neighborhood of the position in question. The construction of SC_{s} dictionaries and the mechanization of synchronizers using nonlinear shift registers are explained in detail. Necessary and sufficient conditions for the existence of SC_{s} codes with specified word lengths are derived. By allowing unequal word lengths in the code, it is demonstrated that a substantial saving in average word length and information rate can be accomplished over other recently proposed codes having synchronization capability.
[1]
S. Golomb,et al.
Comma-Free Codes
,
1958,
Canadian Journal of Mathematics.
[2]
B. H. Jiggs,et al.
Regent Results in Comma-Free Codes
,
1963,
Canadian Journal of Mathematics.
[3]
Willard L. Eastman,et al.
On the construction of comma-free codes
,
1965,
IEEE Trans. Inf. Theory.
[4]
Basil Gordon,et al.
Codes With Bounded Synchronization Delay
,
1965,
Inf. Control..
[5]
I. Reed,et al.
Path-invariant comma-free codes
,
1962,
IRE Trans. Inf. Theory.
[6]
Shimon Even,et al.
On synchronizable and PSK-synchronizable block codes
,
1964,
IEEE Trans. Inf. Theory.