Content deleted Content added
Tag: Reverted |
m Undid edits by 2001:4C4C:1563:2C00:E9E6:2F98:23FF:FF08 (talk) to last revision by LilianaUwU: nonconstructive edits |
||
Line 46:
In doing so, Huffman outdid Fano, who had worked with [[Claude Shannon]] to develop a similar code. Building the tree from the bottom up guaranteed optimality, unlike the top-down approach of [[Shannon–Fano coding]].
== Terminology ==
Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a [[prefix code]] (sometimes called "prefix-free codes", that is, the bit string representing some particular symbol is never a prefix of the bit string representing any other symbol). Huffman coding is such a widespread method for creating prefix codes that the term "Huffman code" is widely used as a synonym for "prefix code" even when such a code is not produced by Huffman's algorithm.
== Problem definition ==
| |||