Introduction to coding theory (CMU, Spr 2010)

February 24, 2010

Lecture 12 summary

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

Bound on number of zeroes of multivariate polynomials and its implication for distance of Reed-Muller codes; Concatenated codes, their rate and lower bound on their distance; Polynomial time construction of asymptotically good binary codes (by finding binary linear codes of block length m meeting the Gilbert-Varshamov bound in 2^{O(m)} time); the Zyablov trade-off between relative distance and rate.


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: