Posted by: atri | February 10, 2012

Lect 10: Dual of a linear code

On Wednesday, we saw some decoding algorithms for linear codes in general and the Hamming code in particular. We ended the lecture by talking about duals of linear codes. The material is from Section 2.5-2.7 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: