Posted by: atri | February 6, 2012

Lect 9: General Hamming Codes

In today’s lecture, we studied two alternate characterizations of the distance of a linear code and then studied the general family of Hamming codes. Today’s material was from Sec 2.3.1 and 2.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: