|
Constructing Code: Expanders
|
Constructing Code: Expanders
Expanders, sparse yet highly connected graphs with additional pseudorandom properties, have been the main combinatorial tool in the explicit constructions of error-correcting codes with fast encoding and decoding algorithms. Recently, these constructions were improved to the point where the rate (a measure of efficiency of the code) vs. error-correction tradeoff is near optimal.  Venkatesan Guruswami presents an overview and recent work which uses expanders and related combinatorial tools to construct codes with linear-time list-decoding algorithms. Based on joint works with Piotr Indyk. From the Series:CSE Colloquia - 2003
Video Length: 3504
Date Found: February 12, 2009
Date Produced: January 21, 2003
View Count: 3
|
|
|
|
|
I got punched by an old guy, for farting near his wife. Read MoreComic book creator Stan Lee talks the future of the medium in the digital age. Panelists Zachary... Read MoreThe U.S. launch of Spotify is still on music lovers' minds. Join Zachary Levi, from NBC’s... Read MoreTuesday: Rupert Murdoch testifies before Parliament on the hacking scandal that brought down "News... Read MoreAfter a long slump, the home construction industry may be showing signs of life. But as Bill... Read More | 1 2 3 4 5 |
|
|
|