Cyclic Redundancy Check Error Detection Simulation

written by Crystal Barchet and Teresa Carrigan

Run model in your browser



This model demonstrates receiving a message using Cyclic Redundancy Check Error Detection.



A generator is chosen randomly from a list of allowed generators, and a random message is created. This message is divided by the generator by using modulo 2 arithmetic, which is the same as XOR. If the remainder is 0, then no errors occured during transmission, and then one bit less than the number of bits in the generator is stripped from the end of the transmitted message. If the remainder is not 0, then an error occured during transmission and the original message can not be recovered.


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.