Pith. sign in

REVIEW 4 cited by

From sequential decoding to channel polarization and back again

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1908.09594 v3 pith:H63H6KYU submitted 2019-08-26 cs.IT math.IT

From sequential decoding to channel polarization and back again

Erdal Ar{\i}kan This is my paper
classification cs.IT math.IT
keywords channelideaspolarpolarizationaccountbackcodescoding
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This note is a written and extended version of the Shannon Lecture I gave at 2019 International Symposium on Information Theory. It gives an account of the original ideas that motivated the development of polar coding and discusses some new ideas for exploiting channel polarization more effectively in order to improve the performance of polar codes.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Finite-Length Empirical Comparison of Polar, PAC, and Invertible-Extractor Secrecy Codes over the Wiretap BSC

    cs.IT 2026-04 unverdicted novelty 6.0

    PAC codes match polar secrecy bounds while improving reliability and both provide tighter finite-length semantic secrecy than invertible-extractor schemes over the wiretap BSC.

  2. Node-Based Soft-Output Fast Successive Cancellation List Decoding of Polar Codes

    cs.IT 2026-04 unverdicted novelty 6.0

    SO-FSCL reduces decoding time steps by 81.8%, additions by 41.3%, and comparisons by 46.4% while matching SO-SCL soft-output performance for polar codes.

  3. On Polar Coding with Feedback

    cs.IT 2026-01 unverdicted novelty 6.0

    Feedback enables genie-aided SC decoding and flexible thresholds that significantly improve finite-length performance of polar codes, with a new characterization of the error event distribution.

  4. Node-Based Soft-Output Fast Successive Cancellation List Decoding of Polar Codes

    cs.IT 2026-04 unverdicted novelty 4.0

    The SO-FSCL algorithm extends fast SCL decoding to provide soft outputs for polar codes with major reductions in latency and complexity and near-identical performance to conventional SO-SCL.