<?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="Code - Page 9 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Code&amp;p=8">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Code&amp;p=10">3.Next</a>
</p>
<p>is the most known algorithm for deriving prefix codes. Prefix codes are widely referred to as "Huffman codes" even when the code was not produced by a Huffman algorithm. Other examples of prefix codes are <a href="page.php?w=telephone_country_codes">telephone country codes</a>, the country and publisher parts of <a href="page.php?w=ISBN">ISBN</a>s, and the Secondary Synchronization Codes used in the <a href="page.php?w=UMTS">UMTS</a> <a href="page.php?w=W-CDMA">WCDMA</a> 3G Wireless Standard.</p>

<p><a href="page.php?w=Kraft%27s_inequality">Kraft's inequality</a></p><p>
<a accesskey="1" href="page.php?w=Code&amp;p=8">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Code&amp;p=10">3.Next</a>
</p>

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

</card>
</wml>
