Self-synchronizing code: Difference between revisions

Revision as of 19:24, 4 December 2010

Revision as of 09:37, 5 December 2010

Line 1:

{{confuse|self-clocking signal}}

In [[telecommunication]]s, a '''self-synchronizing code'''<ref>US [[Federal Standard 1037C]]</ref> is a [[line code]] in which the [[symbol (data)|symbol]] stream formed by a portion of one [[code word]], or by the overlapped portion of any two adjacent code words, is not a valid code word. Put another way, a set of strings (called codewords"code words") over an alphabet is called a self-synchronizing code iff for each string obtained by concatenating two codewordscode words, the substring starting at the second symbol and ending at the second-last symbol does not contain any codewordcode word as substring.

A synonym for self-synchronizing code is '''comma-free code'''<ref>{{citation|last1=Berstel|first1=Jean|last2=Perrin|first2=Dominique|title=Theory of Codes|publisher=Academic Press|year=1985}}</ref>. However, sometimes the term ''comma-free code'' is used in the meaning of [[prefix code]]<ref>US [[Federal Standard 1037C]]</ref>. The latter is a broader concept: every self-synchronizing code is a [[prefix code]], but not all prefix codes are self-synchronizing.