Comma-free code
A comma-free code is block code in which no concatenation of two code words contains a valid code word that overlaps both. Comma-free codes are also known as self-synchronizing block codes because no synchronization is required to find the beginning of a code word. In the literature, the requirement that all code words have to have the same length is sometimes dropped, resulting in the same class as self-synchronizing codes, see Self-synchronizing code.
A comma-free code is block code in which no concatenation of two code words contains a valid code word that overlaps both.[1]
Comma-free codes are also known as self-synchronizing block codes[2] because no synchronization is required to find the beginning of a code word.
In the literature, the requirement that all code words have to have the same length is sometimes dropped, resulting in the same class as self-synchronizing codes, see Self-synchronizing code.
See also
[edit]- Self-synchronizing code
- UTF-8, a comma-free character encoding
References
[edit]- ^ S. W. Golomb; Gordon, Basil; L. R. Welch (1958). "Comma-free Codes". Canadian Journal of Mathematics. Canadian Mathematical Society: 202–209. doi:10.4153/CJM-1958-023-9.
- ^ Donald Knuth (11 December 2015). Universal Commafree Codes. Stanford University. Retrieved 6 February 2016.
External links
[edit]
 | This applied mathematics–related article is a stub. You can help Wikipedia by adding missing information. |