AWhat changed
Arıkan introduced channel polarization and polar codes that achieve the symmetric capacity of binary-input discrete memoryless channels, with encoding and successive cancellation decoding costs of O(N log N) under the stated operation model.
Scientific scope
Arıkan introduced channel polarization and polar codes that achieve the symmetric capacity of binary-input discrete memoryless channels, with encoding and successive cancellation decoding costs of O(N log N) under the stated operation model. The capacity result concerns independent uses of a binary-input discrete memoryless channel, block lengths N=2^n and fixed rate below symmetric mutual information. This equals unrestricted capacity for symmetric channels. The original successive-cancellation error rate and operation count are asymptotic; general code construction, finite-block optimality and physical implementation costs remain separate. Frozen-bit averaging in general channels differs from the symmetric-channel bound. Later sharper rates, list decoding and 5G implementations are not credited to this paper alone.
Evidence
Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.
Contributors
- Erdal Arıkan · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- Arıkan, Channel Polarization, IEEETransactions Information Theory 55(7),3051-3073(2009), originaljournal
- Authorar Xiv 0807.3917 v 5 metadata, abstract andversionhistory
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction