The DOI matches its Crossref record.
Polar codes: Primary concepts and practical decoding algorithms
Abstract
Polar codes represent an emerging class of error-correcting codes with power to approach the capacity of a discrete memoryless channel. This overview article aims to illustrate its principle, generation and decoding techniques. Unlike the traditional capacity-approaching coding strategy that tries to make codes as random as possible, the polar codes follow a different philosophy, also originated by Shannon, by creating a jointly typical set. Channel polarization, a concept central to polar codes, is intuitively elaborated by a Matthew effect in the digital world, followed by a detailed overview of construction methods for polar encoding. The butterfly structure of polar codes introduces correlation among source bits, justifying the use of the SC algorithm for efficient decoding. The SC decoding technique is investigated from the conceptual and practical viewpoints. State-of-the-art decoding algorithms, such as the BP and some generalized SC decoding, are also explained in a broad framework. Simulation results show that the performance of polar codes concatenated with CRC codes can outperform that of turbo or LDPC codes. Some promising research directions in practical scenarios are also discussed in the end.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
She, C., Sun, C., Gu, Z., Li, Y., Yang, C., Poor, H. V., & Vucetic, B. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2021.3053601 · Cited by 405
Ma, Z., Xiao, M., Xiao, Y., Pang, Z., Poor, H. V., & Vucetic, B. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2907245 · Cited by 315
Cross-Layer Optimization for Ultra-Reliable and Low-Latency Radio Access Networks
She, C., Yang, C., & Quek, T. Q. S. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2762684 · Cited by 309
Deep Learning Aided Grant-Free NOMA Toward Reliable Low-Latency Access in Tactile Internet of Things
Ye, N., Li, X., Yu, H., Wang, A., Liu, W., & Hou, X. (2019) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2895086 · Cited by 136
“tile IoT while ensuring certain level of reliability [6], such as short-block channel coding [7], waveform, numerology, and frame structure [4].”
Background
Metadata
- Authors
- Niu, K., Chen, K., Lin, J., & Zhang, Q.
- Venue
- IEEE Communications Magazine
- Published
- 2014-07
- Volume
- 52
- Issue
- 7
- Pages
- 192-203
- ISSN
- 0163-6804 (ISSN-L)
- OpenAlex
- W2061174739
- Cited by
- 209
- References
- 0
- FWCI
- 18.49
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Polar codes: Primary concepts and practical decoding algorithms. https://app.cochat.ai/papers/10.1109/mcom.2014.6852102
- The paper
- Niu, K., Chen, K., Lin, J., & Zhang, Q. (2014). Polar codes: Primary concepts and practical decoding algorithms. IEEE Communications Magazine. https://doi.org/10.1109/mcom.2014.6852102
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.