A sequential decoding method that estimates codeword bits one at a time in a predetermined order, using previously decided bits as known inputs for the likelihood computations of subsequent bits; widely associated with polar codes and used to reduce decoding complexity at the expense of sensitivity to early errors.

Principle

Conditioning each bit decision on earlier decoded bits transforms a high‑dimensional joint decoding problem into a sequence of lower‑dimensional decisions; correctness of later decisions depends causally on the accuracy of earlier ones, creating potential error propagation.

Demonstration

Illustrative scenario: decoding a polar code of length N. The decoder computes likelihoods for the first bit using channel observations and frozen‑bit constraints, decides u_1, then treats u_1 as known when computing likelihoods for u_2, and so on through u_N. If early decisions are correct, later likelihoods simplify; if an early decision is wrong, subsequent decisions may be biased.

Misapplication

Assuming hard early decisions are error‑free and neglecting their uncertainty is a reasoning error; treating plain successive cancellation as adequate for short block lengths without additional measures (list decoding, CRC, or repeated checks) underestimates finite‑length error propagation.

Consequence

For sufficiently long, properly constructed codes, successive cancellation can achieve asymptotically optimal rates under the assumed polarization; in finite length, unmitigated SC can produce higher error rates than methods that manage early decision uncertainty (e.g., SCL or belief propagation).

Reversal

The SC principle relies on polarization or a structure that renders conditional decisions progressively simpler; when that structure is weak (short blocks, poor channel polarization) or early decisions are unreliable, augmented decoders (list decoding, CRC‑aided selection, or hybrid algorithms) are required for practical performance.

Boundary

Clearly within: decoding of polar codes using the natural polarization order and frozen‑bit assignments. Boundary case: applying SC to codes without a polarization property yields unpredictable performance. Clearly outside: maximum‑likelihood or brute‑force joint decoding that does not rely on sequential conditioning.

Semantic Tension

Low computational complexity and structural clarity of sequential decisions versus vulnerability to error propagation and degraded finite‑length performance; practical designs balance SC simplicity with techniques that protect or revisit early decisions.

Synthesis

Successive cancellation exploits a code’s conditional structure to trade joint search complexity for sequential simplicity; making that tradeoff practical requires mechanisms to detect or correct early errors when block lengths or channel conditions prevent reliable early decisions.