Jump to content

Comma-free code

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Smasongarrison (talk | contribs) at 16:23, 17 September 2018 (copy edit with General fixes, added orphan, underlinked tags). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)

This article needs more links to other articles to help integrate it into the encyclopedia. Please help improve this article by adding links that are relevant to the context within the existing text. (September 2018) (Learn how and when to remove this message)

This article is an orphan, as no other articles link to it. Please introduce links to this page from related articles; try the Find link tool for suggestions. (September 2018)

(Learn how and when to remove this message)

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.

References

^ 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

Donald Knuth's 21st Annual Christmas Lecture: Universal Commafree Codes on YouTube

This 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=859988137"

Hidden categories: