The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
How to Construct Polar Codes
Open accessAbstract
A method for efficiently constructing polar codes is presented and analyzed. Although polar codes are explicitly defined, straightforward construction is intractable since the resulting polar bit-channels have an output alphabet that grows exponentially with the code length. Thus, the core problem that needs to be solved is that of faithfully approximating a bit-channel with an intractably large alphabet by another channel having a manageable alphabet size. We devise two approximation methods which “sandwich” the original bit-channel between a degraded and an upgraded version thereof. Both approximations can be efficiently computed and turn out to be extremely close in practice. We also provide theoretical analysis of our construction algorithms, proving that for any fixed ε > 0 and all sufficiently large code lengths n, polar codes whose rate is within ε of channel capacity can be constructed in time and space that are both linear in n.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Arikan, E. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2021379 · Cited by 4,476
Richardson, T., & Urbanke, R. (2008) · Cambridge University Press eBooks · doi:10.1017/cbo9780511791338 · Cited by 2,271
Tal, I., & Vardy, A. (2011) · 2011 IEEE International Symposium on Information Theory Proceedings · doi:10.1109/isit.2011.6033904 · Cited by 537
Self-citationAchieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
Mahdavifar, H., & Vardy, A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2162275 · Cited by 376
Self-citationQuantization of Binary-Input Discrete Memoryless Channels, with Applications to LDPC DecodingPreprint
Kurkoski, B. M., & Yagi, H. (2011) · arXiv (Cornell University) · Cited by 14
Extracting randomness and dependencies via a matrix polarization
Abbe, E. A. (2011) · Cited by 3
Cited by
Simultaneous Wireless Information and Power Transfer (SWIPT): Recent Advances and Future Challenges
Ponnimbaduge Perera, T. D., Jayakody, D. N. K., Sharma, S. K., Chatzinotas, S., & Li, J. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2783901 · Cited by 920
Tal, I., & Vardy, A. (2011) · 2011 IEEE International Symposium on Information Theory Proceedings · doi:10.1109/isit.2011.6033904 · Cited by 537
Self-citation
Metadata
- Authors
- Tal, I., & Vardy, A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2013-10
- Volume
- 59
- Issue
- 10
- Pages
- 6562-6582
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2164368671
- Cited by
- 853
- References
- 8
- FWCI
- 86.35
- Type
- journal article
- Language
- en
- Open access
- green
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: How to Construct Polar Codes. https://app.cochat.ai/papers/10.1109/tit.2013.2272694
- The paper
- Tal, I., & Vardy, A. (2013). How to Construct Polar Codes. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2013.2272694
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.
