The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
Open accessAbstract
A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity$I(W)$of any given binary-input discrete memoryless channel (B-DMC)$W$. The symmetric capacity is the highest rate achievable subject to using the input letters of the channel with equal probability. Channel polarization refers to the fact that it is possible to synthesize, out of$N$independent copies of a given B-DMC$W$, a second set of$N$binary-input channels$\{W_N^{(i)}:1\le i\le N\}$such that, as$N$becomes large, the fraction of indices$i$for which$I(W_N^{(i)})$is near$1$approaches$I(W)$and the fraction for which$I(W_N^{(i)})$is near$0$approaches$1-I(W)$. The polarized channels$\{W_N^{(i)}\}$are well-conditioned for channel coding: one need only send data at rate$1$through those with capacity near$1$and at rate$0$through the remaining. Codes constructed on the basis of this idea are called polar codes. The paper proves that, given any B-DMC$W$with$I(W)> 0$and any target rate$R ≪ I(W)$, there exists a sequence of polar codes$\{{\Fraktur {C}}_n;n\ge 1\}$such that${\Fraktur {C}}_n$has block-length$N=2^n$, rate$\ge R$, and probability of block error under successive cancellation decoding bounded as$P_{e}(N,R) \le O(N^{-{1\over 4}})$independently of the code rate. This performance is achievable by encoders and decoders with complexity$O(N\log N)$for each.
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
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
A Course in Probability Theory
(1974) · Elsevier eBooks · doi:10.1016/c2009-0-22097-6 · Cited by 2,668
Theory and practice of error control codes
Blahut, R. E. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 2,066
Costello, D. J., & Shu, L. (2004) · Cited by 1,564
A class of multiple-error-correcting codes and the decoding scheme
Reed, I. (1954) · Transactions of the IRE Professional Group on Information Theory · doi:10.1109/tit.1954.1057465 · Cited by 864
Application of Boolean algebra to switching circuit design and to error detection
Muller, D. E. (1954) · Transactions of the I.R.E. Professional Group on Electronic Computers · doi:10.1109/irepgelc.1954.6499441 · Cited by 668
Codes on graphs: normal realizations
Forney, G. D. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910573 · Cited by 642
A performance comparison of polar codes and Reed-Muller codes
Arkan, E. (2008) · IEEE Communications Letters · doi:10.1109/lcomm.2008.080017 · Cited by 491
What is the fast Fourier transform?
Cochran, W., Cooley, J., Favin, D., Helms, H., Kaenel, R., Lang, W., Maling, G., Nelson, D., Rader, C., & Welch, P. (1967) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1967.1161899 · Cited by 490
Cited by
On the Road to 6G: Visions, Requirements, Key Technologies, and Testbeds
Wang, C.-X., You, X., Gao, X., Zhu, X., Li, Z., Zhang, C., Wang, H., Huang, Y., Chen, Y., Haas, H., et al. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3249835 · Cited by 2,336
Tal, I., & Vardy, A. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2410251 · Cited by 1,820
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Minimizing Additive Distortion in Steganography Using Syndrome-Trellis Codes
Filler, T., Judas, J., & Fridrich, J. (2011) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2011.2134094 · Cited by 966
Tal, I., & Vardy, A. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2272694 · Cited by 853
Metadata
- Authors
- Arikan, E.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2009-07
- Volume
- 55
- Issue
- 7
- Pages
- 3051-3073
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2150498905
- Cited by
- 4,476
- References
- 13
- FWCI
- 94.51
- 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
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.