Error Correction Using Parity Bits

We know that we can orchestrate bits in such a way as to 1) know when an error occurred and 2) locate the error if we have enough bits. But that's always the problem! We need more bits as our messages grow - but how do we orchestrate this? Once again, Richard Hamming comes to the rescue with his Hamming Code.

Almost there - just need you to log in real quick!

You're not logged in at the moment and the course you're trying to access is for logged in people. If you don't own the course - just head over to our courses page and we'll get you squared away!