Computer Science/Discrete Mathematics Seminar I

Submitted by admin on Thu, 02/21/2013 - 12:01
Polar Codes and Randomness Extraction for Structured Sources
Series: 
Computer Science/Discrete Mathematics
Emmanuel Abbe
Princeton University
Date & Time: 
Mon, 02/25/2013 - 11:15 - 12:15
Location: 
S-101
Video Link: 

http://video.ias.edu/csdm/1213/0225-EmmanuelAbbe

Polar codes have recently emerged as a new class of low-complexity codes achieving Shannon capacity. This talk introduces polar codes with emphasis on the probabilistic phenomenon underlying the code construction. New results and connections to randomness extraction for structured sources are discussed.

terms: