Introduction to coding theory (CMU, Spr 2010)

January 27, 2010

Lecture 5 summary

Filed under: Lecture summary — Venkat Guruswami @ 6:09 pm

We discussed the connections of Shannon’s capacity theorem for BSC and limitations of codes with large minimum distance, and then proved the capacity theorem for the binary symmetric channel. We began a discussion on limitations of codes, i.e., upper bounds on size/rate as a function of minimum distance, and presented the Singleton bound and a version of the Plotkin bound.

Advertisements

Leave a Comment »

No comments yet.

RSS feed for comments on this post. TrackBack URI

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

Blog at WordPress.com.

%d bloggers like this: