Posted by: atri | March 16, 2009

Lecture 22: Johnson Bound

In today’s lecture, we proved the (binary version of) Johnson bound. The stuff that we covered in today’s lecture, can be found in the scribed notes of Lecture 18 from Fall 07. A small caveat: the scribed notes use the notation J_q(n,d,e) instead of the notation L_q(n,d,e) that we defined in the lecture today.

Next lecture, we will start with some quick remarks about the Johnson bound and then will use it to prove the Elias-Bassalygo bound, which will be the last  upper bound on the rate of a code (in terms of its relative distance) that we will study in this course.


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ 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 )


Connecting to %s


%d bloggers like this: