<?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="Richard Hamming - Page 16 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Richard_Hamming&amp;p=15">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Richard_Hamming&amp;p=17">3.Next</a>
</p>
<p>"If the computer can tell when an error has occurred," Hamming reasoned, "surely there is a way of telling where the error is so that the computer can correct the error itself."</p>

<p>Hamming set himself the task of solving this problem, which he realised would have an enormous range of applications. Each bit can only be a zero or a one, so if you know which bit is wrong, then it can be corrected. In a landmark paper published in 1950, he introduced a concept of the number of positions in which two code words differ, and therefore how many</p><p>
<a accesskey="1" href="page.php?w=Richard_Hamming&amp;p=15">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Richard_Hamming&amp;p=17">3.Next</a>
</p>

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

</card>
</wml>
