The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
List Decoding of Polar Codes
Abstract
We describe a successive-cancellation list decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Arıkan. In the proposed list decoder, L decoding paths are considered concurrently at each decoding stage, where L is an integer parameter. At the end of the decoding process, the most likely among the L paths is selected as the single codeword at the decoder output. Simulations show that the resulting performance is very close to that of maximum-likelihood decoding, even for moderate values of L. Alternatively, if a genie is allowed to pick the transmitted codeword from the list, the results are comparable with the performance of current state-of-the-art LDPC codes. We show that such a genie can be easily implemented using simple CRC precoding. The specific list-decoding algorithm that achieves this performance doubles the number of decoding paths for each information bit, and then uses a pruning procedure to discard all but the L most likely paths. However, straightforward implementation of this algorithm requires Ω(Ln2) time, which is in stark contrast with the O(n log n) complexity of the original successive-cancellation decoder. In this paper, we utilize the structure of polar codes along with certain algorithmic transformations in order to overcome this problem: we devise an efficient, numerically stable, implementation of the proposed list decoder that takes only O(Ln logn) time and O(Ln) space.
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
Arikan, E. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2021379 · Cited by 4,476
Channel Coding Rate in the Finite Blocklength Regime
Polyanskiy, Y., Poor, H. V., & Verdu, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2043769 · Cited by 3,885
Stiffler, J. J. (1971) · Cited by 1,438
Tal, I., & Vardy, A. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2272694 · Cited by 853
Self-citationFortney, J. P. (2020) · Discrete Mathematics for Computer Science · doi:10.1201/9781003091479-1 · Cited by 428
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
Wiechman, G., & Sason, I. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.920216 · Cited by 77
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
Towards 6G wireless communication networks: vision, enabling technologies, and new paradigm shifts
You, X., Wang, C.-X., Huang, J., Gao, X., Zhang, Z., Wang, M., Huang, Y., Zhang, C., Jiang, Y., Wang, J., et al. (2021) · Science China Information Sciences · doi:10.1007/s11432-020-2955-6 · Cited by 2,027
Toward Massive, Ultrareliable, and Low-Latency Wireless Communication With Short Packets
Durisi, G., Koch, T., & Popovski, P. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2016.2537298 · Cited by 1,154
LLR-Based Successive Cancellation List Decoding of Polar Codes
Balatsoukas-Stimming, A., Bastani Parizi, M., & Burg, A. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2439211 · Cited by 631
AES as Error Correction: Cryptosystems for Reliable Communication
Cohen, A., D’Oliveira, R. G. L., Duffy, K. R., Woo, J., & Medard, M. (2023) · IEEE Communications Letters · doi:10.1109/lcomm.2023.3285404 · Cited by 19
Metadata
- Authors
- Tal, I., & Vardy, A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2015-05
- Volume
- 61
- Issue
- 5
- Pages
- 2213-2226
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2106045225
- Cited by
- 1,820
- References
- 6
- FWCI
- 135.84
- 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
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.