Jump to content

Comma-free code

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by MindlessXD (talk | contribs) at 07:01, 7 February 2016 (More accurate description and better citation.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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; Basil; L. R. Welch (1958), Canadian Journal of Mathematics, Canadian Mathematical Society, pp. 202–209
  2. ^ Donald Knuth (11 December 2015). Univeral Commafree Codes. Stanford University. Retrieved 6 February 2016.
Stub icon

This computer science 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=703727265"