Posted by: atri | February 16, 2011

Lecture 12: Singleton Bound

In today’s lecture, we finished the proof of the Varshamov bound (and looked at some algorithmic consequences of the use of the probabilistic method). Then we proved the Singleton bound and then stated the Plotkin bound. Today’s material is from lectures 15, 11 and 16 from Fall 2007.

Next lecture, we will begin the proof of the Plotkin bound.

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: