Editing Comma-free code (section)


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>

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.