Hamming Code Simulation

written by Teresa Carrigan

Run model in your browser



After the first two check bits, each additional check bit allows at least double the number of data bits before another check bit is required.

Although there are numerical methods for determining the number of check bits needed, we know that the check bits always go in positions that are powers of two, and if there are no data bits past a check bit position, that check bit is not needed. This gives us an easy way to determine the number of check bits needed.

The group of bits checked by a check bit is easily determined by looking at the binary equivalent of the position number. Each bit in that group will have a 1 in the same place.



Set slow-motion to 0.3, click random, and then click go.

Set the number-of-digits slider to the number of data bits you wish to drill, and click setup. Work each step by hand, and then click the step button to check your answer.


Applets on this website were written by Teresa Carrigan in 2004, for use in computer science courses at Blackburn College, with the exception of the Fireworks applet. The applets made with NetLogo require Java 1.4.1 or higher to run. The applets made with NetBeans require Java 1.4.2 or higher to run. Applets might not run on Windows 95 or Mac OS 8 or 9. You may obtain the latest Java plugin from Sun's Java site.