You are currently browsing the tag archive for the ‘error correcting codes’ tag.

# Tag Archive

## Distinguished Lecture Series II: Avi Wigderson, “Expander graphs – constructions and applications”

11 January, 2008 in DLS, math.CO | Tags: Avi Wigderson, computational complexity, error correcting codes, expander graphs, Ramanujan graphs, zigzag product | by Terence Tao | 8 comments

On Thursday, Avi Wigderson continued his Distinguished Lecture Series here at UCLA on computational complexity with his second lecture “Expander Graphs – Constructions and Applications“. As in the previous lecture, he spent some additional time after the talk on an “encore”, which in this case was how lossless expanders could be used to obtain rapidly decodable error-correcting codes.

The talk was largely based on these slides. Avi also has a recent monograph with Hoory and Linial on these topics. (For a brief introduction to expanders, I can also recommend Peter Sarnak’s Notices article. I also mention expanders to some extent in my third Milliman lecture.)

## Recent Comments