Introduction to coding theory (CMU, Spr 2010)

January 21, 2010

Lecture 3 summary

Filed under: Lecture summary — Venkat Guruswami @ 3:23 pm

We discussed first order Reed-Muller codes, and contrasted the two extremes of Hadamard and Hamming codes. We defined asymptotically good codes families, and posed the question about their existence. We proved the Gilbert-Varshamov bound in two ways, by picking a code greedily and by picking a random linear code. This in particular showed the existence of asymptotically good codes of any rate. En route proving the asymptotic version of the Gilbert-Varshamov bound, we proved entropy estimates for the volume of Hamming balls. We concluded with some remarks on attaining the GV bound explicitly, mentioning the “better than random” algebraic-geometric code constructions, and the conjectured optimality of the GV bound on rate for binary codes.


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: Logo

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

Create a free website or blog at

%d bloggers like this: