Posted by: atri | April 3, 2011

Lecture 28: Justesen Codes

In Friday’s lecture, we saw the Justesen construction of a strongly explicit asymptotically good code. The material was from Lecture 25 from Fall 2007.

Next lecture, we will start looking at decoding algorithms for concatenated codes.

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: