Computer Science/Discrete Mathematics Seminar I

Polar Codes and Randomness Extraction for Structured Sources

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.

Date & Time

February 25, 2013 | 11:15am – 12:15pm

Location

S-101

Affiliation

Princeton University