Posted by: atri | March 29, 2011

Lecture 26: Elias-Bassalygo Bound

In Monday’s lecture, we proved our last combinatorial bound called the Elias-Bassalygo bound. We then took stock of where we were in the course and motivated the idea behind code concatenation, which on Wednesday, we’ll see allows us to construct explicit asymptotically good code. The material for Monday’s lecture is from Lecture 19 from fall 2007.

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: