Comma-free code: Difference between revisions

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
 
imported>Real psychodad
No edit summary
 
Line 3: Line 3:


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.
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.
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]].


== See also ==
== See also ==

Latest revision as of 13:46, 27 July 2025

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.

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.

See also

References

Template:Reflist

External links


Template:Asbox

  1. Script error: No such module "Citation/CS1".
  2. Script error: No such module "Citation/CS1".