|Computer Science/Discrete Mathematics Seminar I|
|Topic:||Polar Codes and Randomness Extraction for Structured Sources|
|Date:||Monday, February 25|
|Time/Room:||11:15am - 12:15pm/S-101|
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.