Pith. sign in

REVIEW 4 major objections 4 minor 33 references

Rate-Matching Deep Polar Codes via Polar Coded Extension

T0 review · 4 major / 4 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper claims that concatenating the layer outputs of a deep polar encoder yields a rate-matched code that outperforms repetition, puncturing, and shortening, especially at medium to high code rates.

desk verdict A genuinely new extension scheme for deep polar codes with a clean gain over repetition and a messier, but not fatal, comparison against puncturing and shortening. read the letter →

arxiv 2505.06867 v1 pith:D6X2QRZN submitted 2025-05-11 cs.IT eess.SPmath.IT

Geon Choi , Namyoon Lee This is my paper · ORCID
classification cs.ITeess.SPmath.IT
keywords deeppolarcodesratematchingcodeextensionsuccessivecancellationlistdecodingsoft-outputdensityevolutionGaussianapproximationshortblocklength
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper offers a way to give deep polar codes—codes built by stacking polar transformation layers before the final polar transform—arbitrary blocklengths without falling back on the usual rate-matching tricks. When the target length $M$ is only a little larger than a power of two, it forms the extended code by concatenating the codewords produced by each layer of the deep polar encoder. Because those layer codewords are themselves polar codewords, they can be decoded with soft-output successive cancellation list decoding, and their reliability values are fed into the main decoder as extra information. The paper argues and simulates that this lowers block error rate relative to repetition, puncturing, and shortening, especially as the code rate climbs, while avoiding the larger mother code that puncturing and shortening require.

What carries the argument

The carrying object is the concatenation of layer outputs: each extension codeword $c_q$ is a polar codeword produced by a transposed polar transform $G_q^\top$, and the same bits are embedded in layer 0's input at connection positions $A_q$. The decoding mechanism is soft-output SCL (SoSCL), which returns reliability values (LLRs) for the connection bits and adds them to the main decoder's LLRs before path-metric updates. The design mechanism is density evolution under Gaussian approximation (DEGA): the recursion that propagates the mean $\eta$ of the right-to-left messages, together with the conservative block error rate bound used to choose which indices are information, connection, or frozen.

What would settle it

Run Monte Carlo decoding of a density-evolution-optimized extended deep polar code at high SNR, compare measured BLER with the paper's bound, and instrument the SoSCL decoder to record the empirical mean and variance of each right-to-left message. If the variance is not close to twice the mean, or if a grid search over the split $K_1$ finds a rate profile with lower BLER than the optimized one, the Gaussian approximation is the weak link.

Watch

Extended reading notes

Core claim

The central claim is that the layered structure of a deep polar code can itself be the rate-matching resource. Treating the output of each pre-transform layer as an extra polar codeword, the paper concatenates $c_0$ (the main layer output) with $c_1,\ldots,c_Q$, so the transmitted word is $c=[c_0,c_1,\ldots,c_Q]$ and the length $M$ is the sum of the layer lengths, no longer restricted to a power of two. The extended pieces are decoded by soft-output successive cancellation list decoding to produce soft LLRs for the connection bits they share with layer 0; these LLRs are added to the main decoder's bit LLRs. With information and connection sets chosen by a density-evolution-based error-probability analysis, the resulting codes have lower block error rate than repetition, puncturing, and shortening in medium-to-high rate regimes, and a greedy version of the design search makes multi-layer extension practical.

Load-bearing premise

The analysis assumes that every internal soft message in the decoder is Gaussian with variance exactly twice its mean, even though the messages at the decoder's edge are binary-valued known quantities; if that approximation fails, the predicted error rates and the chosen rate splits could be off.

Editorial extensions

If this is right

  • Setting $M = N_0 + N_1$, the decoder works at the target length but only decodes the $N_0$-sized main block plus soft outputs from the $N_1$-sized extension, so the complexity overhead over a length-$N_0$ polar decoder is small.
  • The advantage over repetition, puncturing, and shortening grows with code rate, because at high rates puncturing and shortening delete a large fraction of the mother codeword while the extension pieces still deliver useful reliability information.
  • Multi-layer extension works for lengths such as $M=280=256+16+8$ and $M=304=256+32+16$, and the greedy rate-profiling algorithm matches near-exhaustive search while cutting design complexity from exponential to linear in the number of layers.
  • The method plugs into the 5G NR reliability sequence and CRC-aided SCL decoding, so it can reuse existing polar-code infrastructure.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Beyond the paper: the same concatenate-the-layer-outputs idea should transfer to other pre-transformed polar constructions whose intermediate stages produce genuine polar codewords; the essential condition is only that the extension pieces are decodable polar codewords whose soft outputs touch the main codeword's input bits.
  • Beyond the paper: the paper's own optimistic versus conservative error expressions suggest a hybrid design rule—use the optimistic estimate only for layers whose genie-aided soft output is likely reliable, and the conservative bound elsewhere—that could improve the rate profile further.
  • Beyond the paper: if soft-output decoding of a very small extension layer (for example $N_q = 1$ or $2$) is unreliable, plain LLR combining or treating that layer as repetition is likely better; the paper mentions this direction and leaves it open, so a direct comparison at $N_q=1$ would be a natural next experiment.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The manuscript proposes a rate-matching method for deep polar codes when the desired codeword length M is slightly larger than a power of two. The construction concatenates the layer outputs of a deep polar code, c = [c0, c1, ..., cQ], where each cq is a polar codeword generated by a pre-transform layer; the total length is M = N0 + N1 + ... + NQ. The authors develop a soft-output successive cancellation list (SoSCL) decoder that obtains soft information from the extension layers and feeds it into a modified SCL decoder for the main layer. They give a density-evolution under Gaussian approximation (DEGA) analysis of the decoding error probability, use it to design the information and connection index sets, and propose both an exhaustive and a greedy rate-profiling algorithm for multi-layer configurations. Simulations compare the proposed scheme with repetition, puncturing, and shortening over BI-AWGN channels and report BLER gains, especially at medium to high code rates.

Significance. If the empirical gains hold under a fair comparison, the paper offers a useful low-complexity rate-matching option for short-blocklength codes, particularly when the target length is just above a power of two. The construction is simple, the decoding overhead over the component polar decoders is modest, and the proposed greedy algorithm makes multi-layer design tractable. The paper also provides a concrete error-probability design framework, which is a strength even if the Gaussian approximation is heuristic. The main significance is therefore practical: a potential alternative to puncturing and shortening for short-blocklength URLLC-style codes. The novelty relative to the authors' prior work on deep polar codes is incremental but sufficient for a rate-matching contribution.

major comments (4)
  1. [Section V, Figs. 8-11] The headline comparison is not complexity-fair at short blocklengths. Puncturing and shortening are run with mother code length 2*N0 and list size L/2, while the proposed scheme and repetition use mother code length N0 and list size L. The paper justifies this by the asymptotic complexity O(L*N*log N), but at the simulated lengths the decoder budgets are not equal: SCL path management and sorting grow more than linearly in L, and the L=1 baselines have essentially no list diversity, while punctured/shortened decoders can also exploit known or punctured positions to reduce effective work. Since the central claim is a BLER gain at the same overall rate, the comparison should either use the same list size for all schemes or a carefully complexity-matched (energy/latency) accounting. Without this, part of the reported gain over puncturing and shortening may be an artifact of the unequal decoder budget rather than a coding gain of the proposed extension.
  2. [Section III-B, Eq. (23) and Remark 1] There is an internal inconsistency about which soft information is used. Equation (23) combines the SoSCL output only at connection positions A1,I1, i.e., positions corresponding to information bits of layer 1, and sets Lambda_i = 0 elsewhere. However, Remark 1 states that the soft information vector encodes partial reliability knowledge 'including for subsequent frozen bits indexed by A1,F1' and that this is precisely what improves decoding of the first connection bit. Since c1 = u1*G1^T and frozen bits of u1 still affect many bits of c1, the soft outputs at A1,F1 are not known a priori and appear to carry useful information. The authors should clarify which mechanism is actually implemented; if only A1,I1 is used, the decoder is not exploiting the full soft-output structure, and the claimed benefit in Remark 1 is not realized. The same issue applies to Eq. (39) in the multi-layer case.
  3. [Section III-C, Eqs. (28)-(30)] The DEGA analysis assumes that the right-to-left messages satisfy Rd,i ~ N(eta_d,i, 2*eta_d,i), while the text acknowledges that Rn,i is a binary-valued quantity and hence not Gaussian. The design metric (30) and all subsequent rate-profiling in Section III-D rely on the resulting eta values. No validation of this approximation is provided, for example by comparing predicted eta_0,i with empirical means from SoSCL decoding, or by checking whether DEGA-optimized Kq values coincide with parameters found by minimizing the simulated BLER. Because the rate-profiling framework is a claimed contribution, this gap is load-bearing for the design algorithm, even though the measured BLER comparisons themselves do not depend on the approximation.
  4. [Eq. (30)] The index N1-i in eta_0,N1-i is out of range for i=0. For a vector of length N1, the reversal mapping should presumably be N1-1-i. Please correct the formula and verify the index arithmetic, since Eq. (30) is a central design equation and the out-of-range index affects the stated product over i in I1.
minor comments (4)
  1. [Algorithm 2, Section IV-D2] The greedy stopping rule 'the largest Kq such that Pe,q < Pe,q+1' is justified by empirical observations rather than derived. Since the algorithm is a heuristic, please state explicitly what guarantees it does and does not provide, and ideally add a sensitivity check against the exhaustive search for a small case.
  2. [Section III-E, Example] The BEC example would be easier to follow if the bit indices were defined explicitly; the text refers to 'u3' and 'u4' without stating the index ordering used to obtain the erasure probabilities {0.06, 0.44, 0.56, 0.94} for N1=4.
  3. [Throughout] There are typographical errors that should be corrected: 'adoptation' in the introduction, 'detph' in the caption of Fig. 1, and 'blocklenghts' in the conclusion.
  4. [Section V, Fig. 7] The caption and text say Fig. 7 uses SC decoding with an 11-bit CRC, but the legend includes a curve labeled 'Approximated by Eq. (30)'. It would be helpful to state explicitly in the caption that the approximation treats CRC bits as information bits, as the text does.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the extension construction, DEGA-based design, and simulated BLER evaluations are independent; the greedy heuristic is an empirical design choice, not a prediction forced by the analysis.

full rationale

The claimed result (extended deep polar codes achieve lower BLER than repetition, puncturing, and shortening) rests on Monte Carlo simulations of the actual code, not on the DEGA error expressions. The DEGA analysis in Section III-C supplies a design metric (Eqs. (30)-(31)) and is validated against simulation in Fig. 7, but the simulated BLER is not computed from the metric, so the evaluation is independent of the design rule. The rate-profiling in Section III-D optimizes K1 via this metric, and Algorithm 2 uses a greedy criterion that the paper says is based on empirical observations from simulation; however, this is an optimization heuristic whose resulting code is then evaluated by simulation, so no BLER value is forced by construction. The self-citations [14] and [15] provide the deep polar code construction, but the extension and decoding methods are defined in this paper and tested independently; no load-bearing step reduces to a self-citation. The unequal list-size and mother-code-length comparison for puncturing and shortening in Section V is a fairness concern for the empirical claim, not a circularity of the derivation chain.

Assumptions & free parameters 1 free parameters · 5 assumptions · 0 invented entities

The core construction rests on four main premises: the Gaussian approximation for LLR densities (standard for DEGA), the soft-output SCL approximation from [27], the assumption that decoding failures of the two layers are positively correlated so eq. (31) is an upper bound, and the binary-expansion choice of pre-transform sizes N_q (which the paper itself notes may be suboptimal). No invented entities or fitted numeric constants are introduced; the greedy criterion is a rule rather than a fitted number.

free parameters (1)
  • Pre-transform size split N_q from binary representation = Determined by M-N's binary expansion (e.g., 152 = 128 + 16 + 8)
    Ad hoc design choice; Remark 3 notes it may be suboptimal. It determines the code structure and the degrees of freedom in rate profiling.
assumptions (5)
  • domain assumption Gaussian approximation of LLR densities: each LLR is modelled as N(µ,2µ) with σ²=2µ
    Standard DEGA assumption used throughout Section III-C to compute the design metric (30).
  • domain assumption Soft-output approximation from [27]: Λ_i ≈ L0,i + R0,i[ℓ]
    The decoder performance and the eta updates (28)-(29) rely on this approximation for the soft information passed from layer 1.
  • domain assumption Positive correlation of decoding failures of c0 and c1
    Eq. (31) uses 1-(1-Pe,1)(1-Pe,0) as an upper bound; this requires the failure events to be positively correlated, which is plausible but not proven.
  • ad hoc to paper Binary representation of M-N determines pre-transform sizes N_q
    Remark 3 states this construction 'may not yield optimal decoding performance', but it is adopted for arbitrary M.
  • standard math 5G NR reliability sequence for polar constructions
    Used for index selection in rate-profiling (Algorithm 1 and Section V).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Rate-Matching Deep Polar Codes via Polar Coded Extension." pith.science (2026). https://pith.science/paper/D6X2QRZN

@misc{pith2026250506867,
  author       = {Pith},
  title        = {Pith review of: Rate-Matching Deep Polar Codes via Polar Coded Extension},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/D6X2QRZN}},
  note         = {Machine review of arXiv:2505.06867}
}
read the original abstract

Deep polar codes are pre-transformed polar codes that employ a multi-layered polar kernel transformation strategy to enhance code performance in short blocklength regimes. However, like conventional polar codes, their block length is constrained to powers of two, as the final transformation layer uses a conventional polar kernel matrix. This paper introduces a novel rate-matching technique for deep polar codes using code extension, particularly effective when the desired code length slightly exceeds a power of two. The key idea is to exploit the layered structure of deep polar codes by concatenating polar codewords generated at each transformation layer. Based on this structure, we also develop an efficient decoding algorithm leveraging soft-output successive cancellation list decoding and provide comprehensive error probability analysis supporting our code design algorithms. Additionally, we propose a computationally efficient greedy algorithm for multi-layer configurations. Extensive simulations confirm that our approach delivers substantial coding gains over conventional rate-matching methods, especially in medium to high code-rate regimes.

Figures

Figures reproduced from arXiv: 2505.06867 by the authors.

Figure 1
Figure 1. Factor graph of polar transform and its corresponding binary tree, [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Illustration of the encoding for single-layer extended deep polar codes. [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. The proposed LLR combined decoding process. [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figures from the paper (6 more)
Figure 4
Figure 4. Figure 4: An example of extended deep polar codes with parameters [PITH_FULL_IMAGE:figures/full_fig_p006_4.png]
Figure 5
Figure 5. Figure 5: The encoding for multi-layer extended deep polar codes. [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]
Figure 7
Figure 7. Figure 7: BLER performance of repetition-based and the extended deep polar [PITH_FULL_IMAGE:figures/full_fig_p010_7.png]
Figure 8
Figure 8. Figure 8: BLER performance of various rate-matched polar codes with [PITH_FULL_IMAGE:figures/full_fig_p010_8.png]
Figure 10
Figure 10. Figure 10: Required SNR [dB] to achieve BLER 10−3 for each information length K. A point above the zero baseline indicates a performance gain over repetition. For each N0 ∈ {256, 512}, we select 1 pre-transform size from Nq ∈ {16, 32, 64}. B. Required SNR [PITH_FULL_IMAGE:figur…
Figure 11
Figure 11. Figure 11: Required SNR [dB] to achieve BLER 10−3 for each information length K. A point above the zero baseline indicates a performance gain over repetition. For multi-layer configurations, at N0 = 256, we select 2 or 3 pre-transform sizes from Nq ∈ {8, 16, 32}, and at N0 = 512…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

33 extracted references · 29 canonical work pages

  1. [1]

    Channel polarization: A method for constructing capacity- achieving codes for symmetric binary-input memoryless channels,

    E. Arıkan, “Channel polarization: A method for constructing capacity- achieving codes for symmetric binary-input memoryless channels,”IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051–3073, 2009

    work page 2009

  2. [2]

    NR; multiplexing and channel coding,

    3GPP, “NR; multiplexing and channel coding,” TS 38.212, Rel. 16, 2020

    work page 2020

  3. [3]

    Short block-length codes for ultra-reliable low latency communications,

    M. Shirvanimoghaddam, M. S. Mohammadi, R. Abbas, A. Minja, C. Yue, B. Matuz, G. Han, Z. Lin, W. Liu, Y . Li, S. Johnson, and B. Vucetic, “Short block-length codes for ultra-reliable low latency communications,” IEEE Commun. Mag. , vol. 57, no. 2, pp. 130–137, Feb. 2019

    2019

  4. [4]

    Efficient decoders for short block length codes in 6G URLLC,

    C. Yue, V . Miloslavskaya, M. Shirvanimoghaddam, B. Vucetic, and Y . Li, “Efficient decoders for short block length codes in 6G URLLC,” IEEE Commun. Mag. , vol. 61, no. 4, pp. 84–90, Apr. 2023

    work page 2023

  5. [5]

    6G: A welcome chance to unify channel coding?

    M. Geiselhart, F. Krieg, J. Clausius, D. Tandler, and S. ten Brink, “6G: A welcome chance to unify channel coding?” IEEE BITS Inf. Theory Mag., vol. 3, no. 1, pp. 67–80, Mar. 2023

    work page 2023

  6. [6]

    Block orthogonal sparse superposition codes for ultra-reliable low-latency communica- tions,

    D. Han, J. Park, Y . Lee, H. V . Poor, and N. Lee, “Block orthogonal sparse superposition codes for ultra-reliable low-latency communica- tions,” IEEE Trans. Commun. , vol. 71, no. 12, pp. 6884–6897, 2023

    work page 2023

  7. [7]

    Block orthogonal sparse superposition codes for L3 communications: Low error rate, low latency, and low transmission power,

    D. Han, B. Lee, M. Jang, D. Lee, S. Myung, and N. Lee, “Block orthogonal sparse superposition codes for L3 communications: Low error rate, low latency, and low transmission power,” IEEE J. Sel. Areas Commun., vol. 43, no. 4, pp. 1183–1199, 2025

    work page 2025

  8. [8]

    From polar to Reed- Muller codes: A technique to improve the finite-length performance,

    M. Mondelli, S. H. Hassani, and R. L. Urbanke, “From polar to Reed- Muller codes: A technique to improve the finite-length performance,” IEEE Trans. Commun. , vol. 62, no. 9, pp. 3084–3091, Sep. 2014

    work page 2014

Show all 33 references
  1. [9]

    CRC-aided decoding of polar codes,

    K. Niu and K. Chen, “CRC-aided decoding of polar codes,” IEEE Commun. Lett., vol. 16, no. 10, pp. 1668–1671, 2012

    2012

  2. [10]

    Polar codes with dynamic frozen symbols and their decoding by directed search,

    P. Trifonov and V . Miloslavskaya, “Polar codes with dynamic frozen symbols and their decoding by directed search,” in Proc. IEEE Inf. Theory Workshop (ITW), 2013

    2013

  3. [11]

    Parity-check-concatenated polar codes,

    T. Wang, D. Qu, and T. Jiang, “Parity-check-concatenated polar codes,” IEEE Commun. Lett. , vol. 20, no. 12, pp. 2342–2345, Dec. 2016

    2016

  4. [12]

    Parity-check polar coding for 5G and beyond,

    H. Zhang, R. Li, J. Wang, S. Dai, G. Zhang, Y . Chen, H. Luo, and J. Wang, “Parity-check polar coding for 5G and beyond,” in Proc. IEEE Int. Conf. Commun. (ICC) , 2018

    2018

  5. [13]

    From sequential decoding to channel polarization and back again,

    E. Arıkan, “From sequential decoding to channel polarization and back again,” arXiv:1908.09594, 2019, [Online]. Available: https://arxiv.org/abs/1908.09594

    1908 arXiv

  6. [14]

    Deep polar codes,

    G. Choi and N. Lee, “Deep polar codes,” IEEE Trans. Commun., vol. 72, no. 7, pp. 3842–3855, 2024

    2024

  7. [15]

    Sparsely pre-transformed polar codes for low-latency SCL de- coding,

    ——, “Sparsely pre-transformed polar codes for low-latency SCL de- coding,” IEEE Trans. Commun. , 2025, early access

    2025

  8. [16]

    Deep polar codes: An efficient error correction code for short blocklength transmission,

    ——, “Deep polar codes: An efficient error correction code for short blocklength transmission,” in Proc. IEEE Global Commun. Conf. Work- shops (GC Wkshps) , 2023

    2023

  9. [17]

    Sparsely pre-transformed polar codes for low-complexity SCL decoding,

    ——, “Sparsely pre-transformed polar codes for low-complexity SCL decoding,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , 2024

    2024

  10. [18]

    Design of length-compatible polar codes based on the reduction of polarizing matrices,

    D.-M. Shin, S.-C. Lim, and K. Yang, “Design of length-compatible polar codes based on the reduction of polarizing matrices,” IEEE Trans. Commun., vol. 61, no. 7, pp. 2593–2599, 2013

    2013

  11. [19]

    A hybrid ARQ scheme based on polar codes,

    K. Chen, K. Niu, and J. Lin, “A hybrid ARQ scheme based on polar codes,” IEEE Commun. Lett. , vol. 17, no. 10, pp. 1996–1999, 2013

    1996

  12. [20]

    Beyond turbo codes: Rate-compatible punctured polar codes,

    K. Niu, K. Chen, and J.-R. Lin, “Beyond turbo codes: Rate-compatible punctured polar codes,” in Proc. IEEE Int. Conf. Commun. (ICC) , 2013, pp. 3423–3427

    2013

  13. [21]

    A novel puncturing scheme for polar codes,

    R. Wang and R. Liu, “A novel puncturing scheme for polar codes,” IEEE Commun. Lett., vol. 18, no. 12, pp. 2081–2084, 2014

    2014

  14. [22]

    Shortened polar codes,

    V . Miloslavskaya, “Shortened polar codes,” IEEE Trans. Inf. Theory , vol. 61, no. 9, pp. 4852–4865, 2015

    2015

  15. [23]

    An incremental redundancy hybrid ARQ scheme via puncturing and extending of polar codes,

    H. Saber and I. Marsland, “An incremental redundancy hybrid ARQ scheme via puncturing and extending of polar codes,” IEEE Trans. Commun., vol. 63, no. 11, pp. 3964–3973, 2015

    2015

  16. [24]

    An adaptive ir-harq scheme for polar codes by polarizing matrix extension,

    M.-M. Zhao, G. Zhang, C. Xu, H. Zhang, R. Li, and J. Wang, “An adaptive ir-harq scheme for polar codes by polarizing matrix extension,” IEEE Commun. Lett. , vol. 22, no. 7, pp. 1306–1309, 2018

    2018

  17. [25]

    Rate matching for polar codes based on binary domination,

    M. Jang, S.-K. Ahn, H. Jeong, K.-J. Kim, S. Myung, S.-H. Kim, and K. Yang, “Rate matching for polar codes based on binary domination,” IEEE Trans. Commun. , vol. 67, no. 10, pp. 6668–6681, 2019

    2019

  18. [26]

    Structural extension of polar codes via simplex kernels,

    M. Jang, J.-H. Kim, S. Myung, H. Yang, and S.-H. Kim, “Structural extension of polar codes via simplex kernels,” IEEE Trans. Commun. , vol. 68, no. 12, pp. 7337–7351, 2020

    2020

  19. [27]

    Soft-out successive cancelation decoding and its list version for polar codes,

    L. Gao, X. Wu, Y . Yang, J. Hu, and S. Zhang, “Soft-out successive cancelation decoding and its list version for polar codes,” IEEE Wireless Commun. Lett., vol. 14, no. 3, pp. 651–655, 2025

    2025

  20. [28]

    Performance of polar codes with the construc- tion using density evolution,

    R. Mori and T. Tanaka, “Performance of polar codes with the construc- tion using density evolution,” IEEE Commun. Lett. , vol. 13, no. 7, pp. 519–521, 2009

    2009

  21. [29]

    Efficient design and decoding of polar codes,

    P. Trifonov, “Efficient design and decoding of polar codes,” IEEE Trans. Commun., vol. 60, no. 11, pp. 3221–3227, Nov. 2012

    2012

  22. [30]

    Construction and block error rate analysis of polar codes over AWGN channel based on gaussian approximation,

    D. Wu, Y . Li, and Y . Sun, “Construction and block error rate analysis of polar codes over AWGN channel based on gaussian approximation,” IEEE Commun. Lett. , vol. 18, no. 7, pp. 1099–1102, 2014

    2014

  23. [31]

    Polar codes: Primary concepts and practical decoding algorithms,

    K. Niu, K. Chen, J. Lin, and Q. T. Zhang, “Polar codes: Primary concepts and practical decoding algorithms,” IEEE Commun. Mag., vol. 52, no. 7, pp. 192–203, 2014

    2014

  24. [32]

    List decoding of polar codes,

    I. Tal and A. Vardy, “List decoding of polar codes,” IEEE Trans. Inf. Theory, vol. 61, no. 5, pp. 2213–2226, 2015

    2015

  25. [33]

    LLR-based successive cancellation list decoding of polar codes,

    A. Balatsoukas-Stimming, M. B. Parizi, and A. Burg, “LLR-based successive cancellation list decoding of polar codes,” IEEE Trans. Signal Process., vol. 63, no. 19, pp. 5165–5179, 2015

    2015

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.