Anonymous user
Huffman coding: Difference between revisions
no edit summary
No edit summary |
|||
Line 1:
{{incorrect||This is not Huffman coding for a general set of frequencies.}}
{{task|Text processing}}[[wp:Huffman coding|Huffman coding]] is a way of reducing the number of bits it takes to represent a string of symbols. It is a lossless compression algorithm. In order to generate Huffman codes you need to have a list of symbols sorted by their frequency. Say you have these symbols and frequencies:
<pre>A 50%
| |||