## Hamming Code Simulation

## written by Teresa Carrigan

## Run model in your browser

- What is it?
- How it works
- How to use it
- Things to notice
- Things to try
- Extending the model
- NetLogo features
- Related models
- Credits and References
- For more information
- Run model in your browser
- Download the model
- Single webpage version

## WHAT IS IT?

This model demonstrates storing of bit patterns using Hamming SEC, even parity, with up to eight data bits.

## HOW IT WORKS

First a random bit pattern is generated, of the length specified by the number-of-digits slider. Extra bits known as check bits are added so that they occupy positions 1, 2, 4, and 8. If there will be no data bits past a check bit, then that check bit is not needed.Each position is then marked with the binary equivalent of the position number. This will help us determine easily which bits are checked by which check bit. Each check bit has a single one in the binary equivalent of its position number, and checks all bits that have a one in that same place in the binary equivalent. Each check bit will force its own group to have even parity.

HomeApplets 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.