Posted by: atri | March 29, 2013

Lect 29: Code Concatenation

In today’s lecture we formally defined code concatenation and saw we can achieve the Zyablov bound with an explicit code. This material is from Sections 9.1 and 9.2 of the book. On Monday, we will study Justesen’s construction of a strongly explicit asymptotically good code, which is from Sec 9.3 in the book.

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: