Prefix code: Difference between revisions

Content deleted Content added
Ptbotgourou (talk | contribs)
m robot Adding: fr:Code préfixe
m Citation maintenance. [Pu131]Removed redundant parameters. You can use this bot yourself! Report bugs here.
Line 3:
Prefix codes are also known as '''prefix-free codes''', '''prefix condition codes''' and '''instantaneous codes'''. Although [[Huffman coding]] is just one of many algorithms for deriving prefix codes, prefix codes are also widely referred to as "Huffman codes", even when the code was not produced by a Huffman algorithm.
 
The term '''comma-free code''' refers to a more restricted class of codes. Consider the strings of symbols formed by concatenating two codewords. If the substring starting at the second symbol and ending at the second-last symbol does not contain any codewords, then the code is comma-free.<ref>{{citation|last1=Berstel|first1=Jean|last1last2=Perrin|first1first2=Dominique|title=Theory of Codes|publisher=Academic Press|year=1985}}</ref>
The term is sometimes incorrectly applied as a synonym for prefix-free codes.<ref>US [[Federal Standard 1037C]]</ref>