Papers › Channel polarization: A method for constructing capacity-achieving codes for symmetric...
Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
Erdal Arikan
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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⁽ⁱ⁾:1≤i≤N} such that, as N becomes large, the fraction of indices i for which I(W_N⁽ⁱ⁾) is near 1 approaches I(W) and the fraction for which I(W_N⁽ⁱ⁾) is near 0 approaches 1-I(W). The polarized channels {W_N⁽ⁱ⁾} 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 {𝒞ₙ;n≥1} such that 𝒞ₙ has block-length N=2ⁿ, rate ≥R, and probability of block error under successive cancellation decoding bounded as Pₑ(N,R) ≤(N^(-1/4)) independently of the code rate. This performance is achievable by encoders and decoders with complexity O(NlogN) for each.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections