Self-synchronizing code: Difference between revisions

Revision as of 22:41, 25 February 2012

Revision as of 20:17, 24 January 2013

Line 2:

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 "code words") over an alphabet is called a self-synchronizing code if for each string obtained by concatenating two code words, the substring starting at the second symbol and ending at the second-last symbol does not contain any code 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=AcademicPerrin 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.

A self-[[synchronizing]] code permits the proper [[frame synchronization|framing]] of transmitted code words provided that no uncorrected errors occur in the symbol stream; external [[synchronization]] is not required. Self-synchronizing codes also allow recovery from uncorrected errors in the stream; with most prefix codes, an uncorrected error in a single bit may propagate errors further in the stream and make the subsequent data unreadable.

Line 15:

* [[Self-clocking signal]]

==NotesReferences==

{{Reflist}}

* {{citation | last1=Berstel | first1=Jean | last2=Perrin | first2=Dominique | title=Theory of Codes | publisher=Academic Press | year=1985 | zbl=0587.68066 | series=Pure and Applied Mathematics | volume=117 }}

* {{FS1037C MS188}}

==References==

*{{FS1037C MS188}}

{{DEFAULTSORT:Self-Synchronizing Code}}