https://wiki.sarg.dev/index.php?action=history&feed=atom&title=Comma-free_codeComma-free code - Revision history2026-04-22T02:25:08ZRevision history for this page on the wikiMediaWiki 1.44.2https://wiki.sarg.dev/index.php?title=Comma-free_code&diff=27044&oldid=previmported>Real psychodad at 13:46, 27 July 20252025-07-27T13:46:20Z<p></p>
<p><b>New page</b></p><div><br />
A '''comma-free code''' is [[block code]] in which no [[concatenation]] of two [[Code word (figure of speech)|code word]]s contains a valid code word that overlaps both.<ref name="Society1958">{{cite journal |author1=S. W. Golomb |last2=Gordon |first2=Basil |author3=L. R. Welch |title=Comma-free Codes |journal=Canadian Journal of Mathematics |url=https://books.google.com/books?id=oRgtS14oa-sC&pg=PA202 |year=1958 |publisher=Canadian Mathematical Society |pages=202–209 |doi=10.4153/CJM-1958-023-9|doi-access=free }}</ref><br />
<br />
Comma-free codes are also known as ''self-synchronizing block codes''<ref name="KnuthChristmasLecture">{{cite AV media |people=Donald Knuth |date=11 December 2015 |title=Universal Commafree Codes |language=en |url=https://www.youtube.com/watch?v=48iJx8FVuis |access-date=6 February 2016 |publisher=Stanford University}}</ref> because no [[synchronization]] is required to find the beginning of a code word.<br />
<br />
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]].<br />
<br />
== See also ==<br />
* [[Self-synchronizing code]]<br />
* [[UTF-8]], a comma-free character encoding<br />
<br />
== References ==<br />
{{reflist}}<br />
<br />
== External links ==<br />
* {{YouTube|id=48iJx8FVuis|title=Donald Knuth's 21st Annual Christmas Lecture: Universal Commafree Codes}}<br />
<br />
[[Category:Coding theory]]<br />
<br />
<br />
{{applied-math-stub}}</div>imported>Real psychodad