Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 4,476

The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.

Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels

Open access
Arikan, Erdal·2009·IEEE Transactions on Information Theory
DOI 10.1109/tit.2009.2021379
Open this paper in CoChat — free account

Abstract

A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity$I(W)$of any given binary-input discrete memoryless channel (B-DMC)$W$. The symmetric capacity is the highest rate achievable subject to using the input letters of the channel with equal probability. Channel polarization refers to the fact that it is possible to synthesize, out of$N$independent copies of a given B-DMC$W$, a second set of$N$binary-input channels$\{W_N^{(i)}:1\le i\le N\}$such that, as$N$becomes large, the fraction of indices$i$for which$I(W_N^{(i)})$is near$1$approaches$I(W)$and the fraction for which$I(W_N^{(i)})$is near$0$approaches$1-I(W)$. The polarized channels$\{W_N^{(i)}\}$are well-conditioned for channel coding: one need only send data at rate$1$through those with capacity near$1$and at rate$0$through the remaining. Codes constructed on the basis of this idea are called polar codes. The paper proves that, given any B-DMC$W$with$I(W)> 0$and any target rate$R ≪ I(W)$, there exists a sequence of polar codes$\{{\Fraktur {C}}_n;n\ge 1\}$such that${\Fraktur {C}}_n$has block-length$N=2^n$, rate$\ge R$, and probability of block error under successive cancellation decoding bounded as$P_{e}(N,R) \le O(N^{-{1\over 4}})$independently of the code rate. This performance is achievable by encoders and decoders with complexity$O(N\log N)$for each.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.2009.2021379

Cites

13 of 13 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 13 references

Cited by

See all 4,476

Metadata

Authors
Arikan, E.
Venue
IEEE Transactions on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Published
2009-07
Volume
55
Issue
7
Pages
3051-3073
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
DOI
10.1109/tit.2009.2021379
OpenAlex
W2150498905
Cited by
4,476
References
13
FWCI
94.51
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels. https://app.cochat.ai/papers/10.1109/tit.2009.2021379
The paper
Arikan, E. (2009). Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2009.2021379

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.