Shannon–Fano coding: Difference between revisions

Revision as of 07:54, 28 November 2018

Revision as of 17:32, 27 March 2019

Line 90:

:<math>\frac{2\,\text{bits}\cdot(15+7+6) + 3\,\text{bits} \cdot (6+5)}{39\, \text{symbols}} \approx 2.28\,\text{bits per symbol.}</math>

now we should move for the efficiency of encoding by shannon-fano

==Huffman Algorithm==