Polar codes were recently introduced by Arikan. They achieve the symmetric capacity of
arbitrary binary-input discrete memoryless channels under a low complexity successive …

Universal polar codes Page 1 1 Universal Polar Codes S. Hamed Hassani and Rüdiger
Urbanke Abstract—Polar codes, invented by Arikan in 2009, are known to achieve the capacity …

A method for efficiently constructing polar codes is presented and analyzed. Although polar
codes are explicitly defined, straightforward construction is intractable since the resulting …

We prove that, for all binary-input symmetric memoryless channels, polar codes enable
reliable communication at rates within an additive gap ε> 0 to the Shannon capacity with a …

We consider the problem of efficiently constructing polar codes over binary memoryless
symmetric (BMS) channels. The complexity of designing polar codes via an exact evaluation …

Polar coding, proposed by Arikan, makes it possible to construct capacity-achieving codes
for symmetric binary-input discrete memoryless channels, with low encoding and decoding …

A method of constructing rate-compatible polar codes that are capacity achieving at multiple
code rates with low-complexity sequential decoders is presented. The underlying idea of the …

Polar codes, introduced recently by Arikan, are the first family of codes known to achieve
capacity of symmetric channels using a low complexity successive cancellation decoder …

Consider the problem of constructing a polar code of block length for a given transmission
channel. Previous approaches require one to compute the reliability of the synthetic …

We describe a successive-cancellation list decoder for polar codes, which is a
generalization of the classic successive-cancellation decoder of Arıkan. In the proposed list …