Posted by: atri | February 15, 2011

Lecture 11: Gilbert-Varshamov Bound

In Monday’s lecture, we proved the Gilbert-Varshamov bound. I apologize for the confusion while stating the abstract version of the probabilistic method– I’ll go over the last part in the lecture on Wednesday. This material is from lecture 15 from fall 2007.

Here is the blog post with more details on why a non-zero message when multiplied with a random generator matrix gives rise to a uniformly random vector.

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: