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.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

%d bloggers like this: