Posted by: atri | October 24, 2007

Lecture 24: Code Concatenation

In today’s lecture, we saw a new code construction method called code concatenation. We then saw that using code concatenation, we can construct in polynomial time a code that achieves the so called Zyablov bound. In particular, this gives a polynomial time construction of an asymptotically good code.

The construction we talked about today had a bit of unsatisfactory aspect to it: we needed to do a “brute-force” search for a suitable inner code. Next lecture, we will look a “super” explicit construction of an aymptotically good code due to Justesen.

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: