Abstract
Polar codes provably achieve the symmetric capacity of a memoryless channel while having an explicit construction. The adoption of polar codes however, has been hampered by their mediocre error-correcting performance at short block lengths and the low throughput of their successive-cancellation decoding algorithm. In this talk, we will describe the recent progress along both of these fronts, towards practical polar decoders.