Hamming Distance Simulation
written by Crystal Barchet and Teresa Carrigan
- 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 finding the Hamming distance between a set of 4 bit patterns.
HOW IT WORKS
Four random bit patterns are generated. Then, the first two bit patterns are compared and the distance between them is found. Then the first and third patterns are compared, followed by the first and fourth, second and third, second and fourth, and third and fourth. The smallest distance found out of all of the pairs compared is the hamming distance.
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.