Jump to content

Comma-free code

Edit links
From Wikipedia, the free encyclopedia
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

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.


Stub icon

This applied mathematics–related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Comma-free_code&oldid=1273105506"