Posted by: atri | October 26, 2007

Lecture 25: Justesen Codes

In today’s lecture, we saw the construction of a “super” explicit asymptotically good code due to Justesen.

In the next lecture, we will look at algorithms for decoding 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: