Self-synchronizing code: Difference between revisions

Revision as of 02:31, 22 December 2016

Revision as of 02:14, 1 March 2019

Line 1:

{{Use American English|date = March 2019}}

{{Short description|Type of code in coding theory}}

{{Use mdy dates|date = March 2019}}

{{distinguish|self-clocking signal}}

In [[coding theory]], especially in [[telecommunication]]s, a '''self-synchronizing code'''<ref>US [[Federal Standard 1037C]]</ref> is a [[uniquely decodable 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. Every self-synchronizing code is a [[prefix code]], but not all prefix codes are self-synchronizing.