# 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.