Posted by: atri | January 29, 2011

Lecture 5: Hamming Bound

(Guest post by Steve Uurtamo)

Friday’s lecture proved the Hamming Bound for alphabets of size q, introduced finite fields of prime size and began to characterize linear codes over finite fields.

This material came from Lecture 4 and Lecture 5 of Fall 2007.

Next time, we’ll talk further about linear codes and learn some useful and important properties about them.

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: