ICM 2026 Special Section Lecture - Erdal Arikan

ICM 2026 Special Section Lecture - Erdal Arikan

by Erdal Arikan · View the channel on PSI

Formal & Physical Sciences Mathematics PBMathematicsPBWApplied mathematics
🎙 Erdal Arikan 👥 60K 📅 September 10, 2026 ⏱ 41 min 👁 8 📄 original study 🧭 2026-09-10
Available in: English (current) Français

Keywords

polar codeschannel capacitybinary input memoryless channelssuccessive cancellation decodingShannon limit

Summary

The lecture by Erdal Arikan at the ICM 2026 Special Section introduces the fundamental concepts of channel polarization and polar codes, which are the first explicit codes proven to achieve the Shannon capacity for symmetric binary-input memoryless channels. Starting from the basic channel coding problem, Arikan explains the trade-off between rate, error probability, and complexity. He reviews Shannon’s capacity theorem and notes that while capacity achievability was known, no explicit practical codes were proven to attain capacity. Polar codes solve this by using a recursive transform that creates a set of bit-channels that polarize to either perfect or pure-noise channels as block length grows. The construction uses a two-by-two kernel and is analogous to the FFT, enabling efficient encoding and decoding. Through successive cancellation decoding, the decoder estimates bits sequentially, leveraging the polarization effect. The talk includes a martingale-based analysis showing that the fraction of ‘good’ channels converges to the original channel capacity, with an exponential rate of convergence. The presentation is rigorous, with clear mathematical explanations and illustrative diagrams for binary erasure channels. This pioneering work has major implications for modern communication systems, as polar codes are now used in 5G and other standards.

195 words

Critical Evaluation

Value of the Information & Strength of the Argument

The lecture provides exceptional value by presenting a complete and self-contained derivation of polar codes, from the problem statement to the proof of capacity achieving. Arikan’s argumentation is logically structured, building stepwise from the two-by-two transform to the general recursive construction, and using conservation laws and martingale convergence to establish the polarization phenomenon. The inclusion of explicit calculations for the binary erasure channel concretizes the abstract concepts, making the theory accessible while maintaining mathematical rigor. The discussion of complexity addresses engineering concerns, strengthening the practical relevance of the theoretical contribution.

Scientific Rigor, Source Quality, Title Accuracy

The scientific rigor is impeccable: Arikan is the originator of polar codes, and the presentation is based on his seminal work. He correctly attributes the capacity theorem to Shannon and references the open problem of explicit capacity-achieving codes. The lecture does not rely on external sources but presents original proofs and constructions. The title accurately describes the special section lecture format and the speaker. The lack of citations in the talk is appropriate for a focused presentation of one’s own research, and the mathematical derivations are thorough and precise.

194 words

Title / Content Match

The title accurately reflects the content: a special section lecture by Erdal Arikan on channel polarization and polar codes.

Quality & Reliability

9/10

Presentation by the inventor of polar codes at a major mathematical conference, with rigorous proofs and clear explanations.

Key Moments

Markers derived by PSI from the transcript: the creator did not define chapters.

Contribution & Novelties

The lecture presents the original contribution of polar codes, which was published in 2009. This is the first explicit construction of codes that provably achieve the symmetric capacity of binary-input memoryless channels, closing a gap left by Shannon’s non-constructive proof. The method is simple, recursive, and has low complexity, making it immediately applicable. The talk also provides insight into the polarization phenomenon, which has become a subject of independent mathematical interest.

Pour aller plus loin :

  • Polar code (coding theory) — Overview of polar codes and their applications.
  • Channel capacity — Fundamental concept underlying the capacity-achieving property.
  • Successive cancellation decoding — The decoding algorithm used for polar codes, with related technical details.
  • Shannon–Hartley theorem — For comparison with additive white Gaussian noise channels and capacity limits.

126 words

Radar Profile

The radar profile is strongly skewed toward quantitative and technical scores, reflecting a dense and rigorous mathematical lecture with little to no emphasis on qualitative aspects. High scores in all four dimensions indicate exceptional depth, reliability, and information density, appropriate for a specialized academic audience.

Reliability 9/10