REVIEW 3 major objections 5 minor 18 references
Subcode Ensemble Decoding of Polar Codes
T0 review · 3 major / 5 minor · reviewed 2026-08-16 · deepseek-v4-flash
Pith's one-line read Subcode ensemble decoding lifts polar codes 0.1–0.25 dB at fixed list size, the paper reports.
desk verdict A useful new framework for ScED in polar codes, but the reported gains rest on an unverified -- and for M=2 impossible -- covering condition, so the performance claims are not yet supported. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the PT-C pre-transformation: an affine map $T(u_p) = u_p A + b$, with upper triangular $A$ and target bits chosen inside the information set, applied only on the decoding side. Applied to the polar graph, it turns target information bits into dynamic frozen bits, defining a subcode $C_T$ of the transmitted polar code; because $A$ is upper triangular, the decoder can evaluate these constraints sequentially. The ensemble design then relies on two conditions: the subcodes must jointly cover the original code (union over $i$ of $C_i = C$), and the $M$ subcodes should be chosen to maximize how many recorded undecodable received patterns they jointly correct, subject to the subcode estimate having a lower path metric so it survives the ML-in-the-list decision.
What would settle it
Take one optimized ScED ensemble (e.g., ScED-8-SCL-8 for $C_T(256,128)$) and test whether every codeword of $C$ lies in at least one subcode $C_i$; if any codeword is missing, transmit it and observe that no path can return it, giving a lower FER bound that would show up as a floor in longer simulations.
Extended reading notes
Core claim
The paper's central claim is that polar subcodes created by PT-C pre-transformations form an effective ensemble decoder: run $M$ parallel SCL decoders, each on a different joint graph, collect the candidate codewords, and pick the one maximizing the channel log-likelihood among valid codewords of the original polar code. A theorem shows that in the SC regime, whenever stand-alone SC decoding succeeds on a transmitted codeword that lies in the subcode, the subcode decoder also succeeds; hence an ensemble whose subcodes cover the whole code is never worse than SC decoding, and the empirical results extend this advantage to SCL decoding. Concretely, $\mathrm{ScED}\text{-}M\text{-}\mathrm{SCL}\text{-}L$ beats $\mathrm{SCL}\text{-}L$ by 0.1–0.25 dB at FER $10^{-3}$ across the tested 5G polar codes, and two SCL-$L$ subcode decoders match one SCL-$2L$ decoder for $C_T(64,32)$, while eight are needed for the longer rate-$1/4$ and rate-$1/2$ codes.
Load-bearing premise
The load-bearing premise is that the selected PT-C subcodes jointly cover the whole polar code (condition (1)); the paper asserts this following [7], but the design algorithm only maximizes how many recorded error patterns are decoded and never verifies that every codeword belongs to at least one subcode, so a transmitted codeword outside all subcodes can never be decoded correctly.
Editorial extensions
If this is right
- For every tested 5G polar code, $\mathrm{ScED}\text{-}M\text{-}\mathrm{SCL}\text{-}L$ outperforms stand-alone $\mathrm{SCL}\text{-}L$ by 0.1 to 0.25 dB at FER $10^{-3}$ with the same list size per path.
- For the short code $C_T(64,32)$, two SCL-$L$ subcode decoders match the FER of one SCL-$2L$ decoder, for $L \in \{8,16\}$; longer rate-$1/4$ and rate-$1/2$ codes need eight paths to match SCL-$2L$.
- Because SCL-$2L$ costs more than five times the chip area of SCL-$L$, the matching performance can be obtained by reusing $L$-sized decoder hardware across paths, or by computing paths in parallel to cut latency.
- PT-C depth trades subcode size against error correction: depth $d_p = 2$ appears the sweet spot in the paper's analysis, since deeper subcodes cover only $2^{k-d_p}$ codewords and require more paths to maintain covering.
Reading between the lines
- A direct verification of the covering condition (1) for the optimized ensembles would determine whether the reported FER is upper-bounded by uncorrectable codewords; the selection algorithm in Sec. IV-B maximizes URP coverage but does not prove union equality.
- Because PT-C changes only the decoding graph, the same ensemble construction should transfer to other polar-style decoders (BP, soft cancellation) and to PAC or row-merged variants, where the dynamic-frozen-bit structure already exists.
- The SC theorem suggests the gain mechanism is that subcode decoders can succeed on error patterns that confuse the full-code decoder; combining PT-C ensembles with automorphism ensembles would mix two orthogonal sources of diversity, although the paper does not test this.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper extends subcode ensemble decoding (ScED) to polar codes by introducing a new class of pre-transformations, called PT-C, which are used only at the decoder side. The authors propose a unified framework for pre-transformations (PT-A, PT-B, PT-C), prove a correctness theorem for SC decoding on a single subcode, describe a data-driven selection procedure for choosing an ensemble of PT-C subcodes, and report Monte-Carlo FER simulations showing that ScED with M SCL-L decoders outperforms stand-alone SCL-L decoding by 0.1 to 0.25 dB at FER 1e-3, with two SCL-L paths matching one SCL-2L decoder for a short 5G polar code.
Significance. If the reported gains are fully supported, the paper offers a practically relevant alternative to increasing the list size in SCL decoding, with potential hardware re-utilization or latency reduction. The paper has clear strengths: the classification of pre-transformations is useful, the proof of Theorem 1 is clean for the SC setting, the simulation setup includes an ML benchmark for the short code, and the empirical comparison is concrete. However, the central covering condition is neither enforced nor verified, the theoretical result does not cover the SCL decoders used in all reported simulations, and several simulation parameters (PT-C depth, transmitted-codeword distribution, URP sampling SNR) are unspecified. These gaps currently prevent the reader from assessing whether the reported FER gains hold for the general polar code or only for a restricted set of transmitted codewords.
major comments (3)
- [§III-B, Eq. (1); §IV-B; §V] The covering condition in Eq. (1) is load-bearing but is never verified. The design algorithm in §IV-B maximizes the number of decoded URPs and does not check that the union of the selected PT-C subcodes equals the original code C. For M=2 and depth dp=2 this is impossible by cardinality: each subcode has size 2^{κ-2}, so the union has size at most 2^{κ-1} < |C|; even for dp=1, two random affine hyperplanes do not in general cover C. The manuscript must state the PT-C depth dp used in the final ensembles of §V, verify condition (1) for the selected ensembles (e.g., an exact coverage check for the short code or a constructive covering argument), and report which codewords are transmitted in the simulations. If codewords were drawn uniformly from C, uncovered codewords would produce a FER floor far above 1e-3; if only codewords lying in the union were transmitted, the reported results do not support the general claim.
- [§III-B, Theorem 1] Theorem 1 concerns only SC decoding, and its proof relies on the two decoders making the same decisions up to the target bit; this argument does not directly extend to SCL decoding, where list branching, path-metric comparisons, and the final CRC-based selection change the decision process. The paper explicitly states that SCL analysis is future work, yet all reported gains in §V are for ScED-M-SCL-L. The theorem therefore cannot be cited as theoretical support for the headline SCL-based claim, which currently rests solely on simulations. Please either provide an SCL analysis or clearly label the theoretical contribution as SC-only and present the SCL results as purely empirical.
- [§IV-B] The ensemble selection procedure is based on decoding a set of 1000 URPs-SCL-L, but the operating SNR for sampling these URPs is not reported and no independent validation set is used to check for overfitting of the union-maximization heuristic. Since the selected ensemble is then used directly in the reported FER curves, please specify the URP sampling SNR, the number of training URPs, and provide a validation check (e.g., performance on a fresh URP set or a coverage check on the codeword space) to show that the observed gains are not an artifact of the particular training set.
minor comments (5)
- [Fig. 4 and Fig. 5 captions] The captions are inconsistent with the text: §IV-A says 192 random PT-Cs are selected per 100 URPs, but the Fig. 5 caption says 190 new decoders; please make the numbers consistent.
- [§IV-A] The text states that URPs-SC are sampled at Eb/N0 = 2.5 dB, but the Fig. 4 caption omits this SNR information; please add it to the caption.
- [§II-C] The statement "If x̂_i ∈ C_i, the ith subcode decoding converged successfully" is most natural for iterative decoders such as BP; for SCL decoding the analog of successful convergence should be defined more precisely, since SCL always outputs a codeword in the subcode by construction.
- [§IV-B] The path-metric condition is only referenced via [18, Eq. (10)]; please reproduce the condition or give a self-contained definition so that the selection criterion is understandable without consulting the reference.
- [§V] The FER plots do not show confidence intervals or error bars; given the statement that at least 1000 frame errors are simulated per point, please add standard errors or state the uncertainty explicitly.
Circularity Check
No circularity: the PT-C ensemble is evaluated by fresh Monte-Carlo simulation, and the ScED framework is borrowed, not derived, from prior work.
full rationale
The paper's derivation chain is not circular. ScED and condition (1) are taken from [7], a prior paper by overlapping authors, but the present contribution—PT-C pre-transformations and the empirical FER comparison—is not derived from [7] in a way that reduces to the conclusion. The ensemble selection in Sec. IV-B is a heuristic that maximizes jointly decoded URPs; the reported FER curves in Sec. V are measured by independent Monte-Carlo simulation, not predicted from that fitted selection. No equation is defined in terms of the result it claims to establish, and no fitted parameter is relabeled as a prediction. The one substantive weakness is that the covering condition (1) is asserted in Sec. III-B 'following [7]' and the design algorithm in Sec. IV-B does not verify it; for some parameters coverage is even impossible by cardinality. However, that is an unverified assumption, a correctness risk for the reported gains, not a circular reduction: the paper never equates the coverage condition with the selection objective or derives the FER from the assumption. Per the hard rules, an unsupported assumption without an exhibited equation-to-equation reduction or fitted-parameter rename is not circularity, so the score is 0.
Assumptions & free parameters
free parameters (3)
- PT-C ensemble {A_i, b_i}, i=1..M =
not specified in paper
- Ensemble size M =
2 for (64,32), 8 for (256,k)
- PT-C depth dp =
suggested 2; final value not stated
assumptions (4)
- ad hoc to paper The M selected PT-C subcodes jointly cover the original polar code (Eq. (1)).
- ad hoc to paper SCL decoding on a PT-C joint graph benefits from the same correctness guarantee as SC decoding in Theorem 1.
- domain assumption The Monte Carlo FER results are representative for arbitrary transmitted codewords.
- domain assumption The BI-AWGN channel model and density evolution or the 5G reliability sequence define the information sets.
Cite this review
Pith. "Pith review of Subcode Ensemble Decoding of Polar Codes." pith.science (2026). https://pith.science/paper/VWWXEQAB
@misc{pith2026250417511,
author = {Pith},
title = {Pith review of: Subcode Ensemble Decoding of Polar Codes},
year = {2026},
howpublished = {\url{https://pith.science/paper/VWWXEQAB}},
note = {Machine review of arXiv:2504.17511}
}
read the original abstract
In the short block length regime, pre-transformed polar codes together with successive cancellation list (SCL) decoding possess excellent error correction capabilities. However, in practice, the list size is limited due to the suboptimal scaling of the required area in hardware implementations. Automorphism ensemble decoding (AED) can improve performance for a fixed list size by running multiple parallel SCL decodings on permuted received words, yielding a list of estimates from which the final estimate is selected. Yet, AED is limited to appropriately designed polar codes. Subcode ensemble decoding (ScED) was recently proposed for low-density parity-check codes and does not impose such design constraints. It uses multiple decodings in different subcodes, ensuring that the selected subcodes jointly cover the original code. We extend ScED to polar codes by expressing polar subcodes through suitable pre-transformations (PTs). To this end, we describe a framework classifying pre-transformations for pre-transformed polar codes based on their role in encoding and decoding. Within this framework, we propose a new type of PT enabling ScED for polar codes, analyze its properties, and discuss how to construct an efficient ensemble.
Figures
Figures from the paper (1 more)
Reference graph
Works this paper leans on
-
[1]
E. Arikan, “Channel polarization: A method for constructing capacity- achieving codes for symmetric binary-input memoryless channels,”IEEE Trans. Inf. Theory , vol. 55, no. 7, Jul. 2009
work page 2009
-
[2]
I. Tal and A. Vardy, “List decoding of polar codes,” IEEE Trans. Inf. Theory, vol. 61, no. 5, May 2015
work page 2015
-
[3]
Design of polar codes in 5G new radio,
V . Bioglio, C. Condo, and I. Land, “Design of polar codes in 5G new radio,” IEEE Commun. Surv. Tuts. , vol. 23, no. 1, Jan.-Mar. 2021
work page 2021
-
[4]
Trends in channel coding for 6G,
S. Miao, C. Kestel, L. Johannsen, M. Geiselhart, L. Schmalen, A. Balatsoukas-Stimming, G. Liva, N. Wehn, and S. ten Brink, “Trends in channel coding for 6G,” Proc. IEEE, Jul. 2024
work page 2024
-
[5]
Automorphism ensemble polar code decoders for 6G URLLC,
C. Kestel, M. Geiselhart, L. Johannsen, S. ten Brink, and N. Wehn, “Automorphism ensemble polar code decoders for 6G URLLC,” in Proc. Int. ITG Workshop on Smart Antennas (WSA) and Conf. on Systems, Commun., and Coding (SCC) , Braunschweig, Germany, Mar. 2023
work page 2023
-
[6]
Automorphism ensemble decoding of Reed–Muller codes,
M. Geiselhart, A. Elkelesh, M. Ebada, S. Cammerer, and S. ten Brink, “Automorphism ensemble decoding of Reed–Muller codes,”IEEE Trans. Commun., vol. 69, no. 10, Oct. 2021
work page 2021
-
[8]
Ensemble belief propagation decoding for short linear block codes,
K. Kraft, M. Herrmann, O. Griebel, and N. Wehn, “Ensemble belief propagation decoding for short linear block codes,” in Proc. Int. ITG Workshop on Smart Antennas (WSA) and Conf. on Systems, Commun., and Coding (SCC) , Braunschweig, Germany, Mar. 2023
work page 2023
-
[9]
Endomorphisms of linear block codes,
J. Mandelbaum, S. Miao, H. J ¨akel, and L. Schmalen, “Endomorphisms of linear block codes,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , Athens, Greece, Jul. 2024
work page 2024
Show all 18 references
-
[10]
Multiple-bases belief-propagation decoding of high-density cyclic codes,
T. Hehn, J. B. Huber, O. Milenkovic, and S. Laendner, “Multiple-bases belief-propagation decoding of high-density cyclic codes,” IEEE Trans. Commun., vol. 58, no. 1, Jan. 2010
2010
-
[11]
Polar codes for automorphism ensemble decoding,
C. Pillet, V . Bioglio, and I. Land, “Polar codes for automorphism ensemble decoding,” in Proc. Inf. Theory Workshop (ITW) , Kanazawa, Japan, Nov. 2021
2021
-
[12]
On the automorphism group of polar codes,
M. Geiselhart, A. Elkelesh, M. Ebada, S. Cammerer, and S. ten Brink, “On the automorphism group of polar codes,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , Melbourne, Australia, Jul. 2021
2021
-
[13]
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 Trans. Commun. , vol. 13, no. 7, Jul. 2009
2009
-
[14]
A simplified successive- cancellation decoder for polar codes,
A. Alamdar-Yazdi and F. R. Kschischang, “A simplified successive- cancellation decoder for polar codes,” IEEE Commun. Lett. , vol. 15, no. 12, Dec. 2011
2011
-
[15]
From sequential decoding to channel polarization and back again,
E. Arıkan, “From sequential decoding to channel polarization and back again,” arXiv preprint arXiv:1908.09594 , 2019. [Online]. Available: https://arxiv.org/abs/1908.09594
1908 arXiv
-
[16]
Row-merged polar codes: Analysis, design, and decoder implementation,
A. Zunker, M. Geiselhart, L. Johannsen, C. Kestel, S. ten Brink, T. V ogt, and N. Wehn, “Row-merged polar codes: Analysis, design, and decoder implementation,” IEEE Trans. Commun. , vol. 73, no. 1, Jul. 2025
2025
-
[17]
Polar subcodes,
P. Trifonov and V . Miloslavskaya, “Polar subcodes,” IEEE J. Sel. Areas Commun., vol. 34, no. 2, Nov. 2016
2016
-
[18]
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, Oct. 2015
2015
-
[2025]
Available: https://arxiv.org/abs/2501.11993
[Online]. Available: https://arxiv.org/abs/2501.11993
Reviewed August 16, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.