Posted by: atri | March 30, 2011

Lecture 27: Code Concatenation

In today’s lecture, we formally defined code concatenation and proved that explicit codes exist on the Zyablov bound. This material is from Lecture 24 from Fall 2007.

Next lecture, we will study Justesen’s strongly explicit construction of an asymptotically good code.

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: