Posted by: atri | January 29, 2012

## Lect 5: Hamming Code

On Friday, we finished the proof of the tight connection between the distance of a code and its error-correctability. We then studied the Hamming code and proved that its distance is $3$. The material was from Sec 1.4 in the book.