<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Huffman coding - Page 5 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Huffman_coding&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Huffman_coding&amp;p=6">3.Next</a>
</p>
<p>any codes were the most efficient, was about to give up and start studying for the final when he hit upon the idea of using a frequency-sorted <a href="page.php?w=binary_tree">binary tree</a> and quickly proved this method the most efficient.</p>

<p>In doing so, Huffman outdid Fano, who had worked with <a href="page.php?w=Claude_Shannon">Claude Shannon</a> to develop a similar code.  Building the tree from the bottom up guaranteed optimality, unlike the top-down approach of <a href="page.php?w=Shannon-Fano_coding">Shannon-Fano coding</a>.</p>

<p><big> Terminology </big></p><p>
<a accesskey="1" href="page.php?w=Huffman_coding&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Huffman_coding&amp;p=6">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
