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.

See also

References

  1. ↑ 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.
  2. ↑ Donald Knuth (11 December 2015). Universal Commafree Codes. Stanford University. Retrieved 6 February 2016.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.