Polar codes and successive-cancellation decoding
Research context
research method · established · As of 2026-10-10
Arıkan's transform recursively turns a binary-input memoryless channel into synthetic channels with polarized reliabilities.
Key knowledge
Arıkan's transform recursively turns a binary-input memoryless channel into synthetic channels with polarized reliabilities. Selecting information and frozen positions supports asymptotic rates up to symmetric capacity with successive-cancellation encoding/decoding complexity O(N log N). For symmetric channels this equals capacity; nonsymmetric channels require attention to the input distribution. Finite-length performance, construction and alternative decoders are separate engineering questions.
Conditions and scope
- The original construction uses N=2^m and a binary-input DMC; distinguish symmetric from unconstrained capacity.
- The result is asymptotic and assumes the prescribed decoding/channel model; burst memory and mismatched likelihoods change it.
Sources · 1
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Author checked this English statement, displayed equation where present and stated hypotheses against these source locations: Theorems 1–3, binary-input DMC symmetry/input distribution, successive cancellation and complexity. The check is bounded to the recorded claims; no complete proof reconstruction, software proof replay or universal literature completeness is claimed.
2026-10-10 · Author source-body/statement/equation/domain check, with graph associations scoped individually. Separate independent content/source/inventory review is required before branch closure.
Entry details
Permanent link to this entry ↗- Record identity
- research-info-polar-coding
- Revision
- research.1
- Structured reference record
- Postgraduate & research reference