- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes a conditional masked diffusion framework for decoding error-correcting codes. It uses the observations received from the physical channel as fixed conditioning information and employs a CrossMPT to estimate bit-wise posterior probabilities. The authors further introduce a beam-search decoder inspired by the Maxwell construction. The decoder branches at low-confidence positions and prunes candidate paths using parity-check constraints. The experiments cover different code families (e.g., Polar, LDPC, and BCH codes), code rates, and SNRs. The results show that the Maxwell decoder outperforms its single-path diffusion counterpart and achieves competitive decoding performance in most settings.
Critical strengths
-
The paper presents a conditional masked-diffusion formulation for decoding linear codes. It progressively revealing masked codeword bits, offering an alternative to the continuous denoising approaches of DDECC and SB-ECC.
-
The Maxwell-inspired beam decoder combines model-guided branching, parity propagation, and minimum-distance selection from the final candidate list. This extension substantially improves upon the single-trajectory decoder and achieves lower reported BER than SB-ECC in most evaluated BPSK-AWGN settings.
Critical weaknesses
-
As currently presented, the sampled loss used in Eq. (11) does not appear to be an unbiased estimator of Eq. (7). There may be a gap between the theoretical analysis and the optimization objective. Correct me if I am wrong.
-
The base model, which uses masked diffusion, performs worse than the SOTA model SB-ECC and, in some cases, even the denoising diffusion model DDECC.
-
The weaker performance of the base model suggests that most of the performance gains may come from Maxwell beam search. However, the manuscript does not appear toprovide sufficient ablation studies or analysis of Maxwell beam search.
-
Since Maxwell beam search performs MAP-based selection within a restricted candidate set, more extensive comparisons with similar algorithms, including conventional non-NN methods, are needed. Examples include the original BP-based Maxwell decoder (whereas this work uses NN predictions in place of BP) and the family of ordered statistics decoding (OSD) methods.
Questions for authors
Please refer to the Weaknesses section.
4 comments
W3. Insufficient Maxwell beam-search ablations and analysis
We agree that the contribution of Maxwell beam search and its components requires further analysis. We added a component ablation study in Appendix J (Table 8), comparing final codeword selection, parity propagation, and iterative completion on Polar(128,64) and CCSDS(128,64). Iterative completion improves performance on both codes. Minimum-distance selection improves performance substantially on Polar, with a smaller observed effect on CCSDS. Parity propagation has a negligible observed effect in these experiments.
We also added a comparison of BP with and without Maxwell beam search on CCSDS(128,64) and Polar(128,64) in Figure 5, with discussion in Section 5.2 and implementation details in Appendix D.3. This examines the contribution of search with a non-neural posterior estimator. Together, these comparisons clarify which components contribute to the gains and how the benefit of search depends on the posterior estimator and code structure.
Changes to the manuscript:
- Added the Maxwell component ablation study in Appendix J (Table 8).
- Added the BP versus BP-MBS comparison in Figure 5 and Appendix D.3.
W4. Comparisons with BP-based Maxwell decoding and OSD
We agree that comparisons with stronger conventional decoders are important. We added Appendix F (Tables 3 and 4), comparing CRC-free SCL with list size 64 for Polar codes and channel-LLR OSD of orders 1 and 2 for LDPC, BCH, MacKay, and CCSDS codes against the Maxwell results in Table 1 at . The tables report the list sizes and OSD candidate counts explicitly: OSD-1 and OSD-2 enumerate and candidates, respectively, whereas Maxwell and SCL use a maximum list size of 64.
We also added BP with and without Maxwell beam search on CCSDS$(128,64)$ and Polar$(128,64)$ in Figure 5. This replaces the neural posterior estimator with BP while retaining the search mechanism, directly examining the benefit of search with a non-neural estimator. On CCSDS, BP-Maxwell outperforms both neural diffusion baselines—plain conditional diffusion and SB-ECC—and approaches neural Maxwell. On Polar, BP provides poor posterior estimates; adding Maxwell beam search yields only a modest improvement and does not close the gap to the neural methods. This contrast shows that the benefit of search depends on the quality of the underlying posterior estimates. The results are discussed in Section 5.2, with implementation details in Appendix E.3. Additional Polar SCL comparison details appear in Appendix E.4.
Changes to the manuscript:
- Added SCL-64 versus Maxwell for Polar codes in Appendix F, Table 3, and OSD-1/OSD-2 versus Maxwell for LDPC, BCH, MacKay, and CCSDS codes in Table 4, including decoder configurations and candidate counts.
- Added the BP versus BP-Maxwell comparison in Figure 5, with discussion in Section 5.2 and implementation details in Appendix E.3.
Thank you very much for your continued engagement in the review process and for raising your useful concerns. Our responses are given below.
- We believe that the changes to the paper, which were made in response to the reviewers' requests, are significant but do not make the new version substantially different. Although, the title was changed to highlight the paper’s main contributions, both the abstract and the introduction in the initial version stated that our goal was to build a beam search for ECC in a principled way, and the entire paper was built toward beam search from the beginning.
- The changes to the method, such as early exits and completion attempts, were added in response to justified concerns about complexity. These changes do not change the character of the paper; they are refinements that improve the method we initially submitted.
- Regarding more extensive experiments on beam search with other neural decoders, the reference methods use Gaussian noise and do not extend naturally to masking. One could devise a Chase-like decoder for those methods, but that would deviate from our method. We did compare BP with Maxwell and showed, surprisingly, that it beats all neural methods for the CCSDS code, but not for Polar codes. Comparing with other decoders that are not diffusion-based and predict bits would essentially amount to comparing the same method with a different backbone in place of CrossMPT. We are willing to add a comparison with the masked-diffusion-based decoder that the reviewer has in mind and include it in the paper.
- Regarding more extensive experiments, we provide tail statistics in Appendix K.2. We are unsure what the reviewer means by alternative search strategies. We proposed a method and compared it with state-of-the-art methods, including the newly added comparisons with SCL and OSD and Appendix F. We believe this should address your concerns. We are also willing to add further ablations of training hyperparameters and decoder performance throughout training.
- SB-ECC was trained for 3M steps with a batch size of 256. It is true that it is sensitive to the training budget. The original method was trained for 1.5M steps; we doubled this budget to reach saturation. We also allowed it to run for 100 diffusion steps, at which point we observed saturation in decoding performance. Based on our experiments and communication with the SB-ECC authors, training longer or using more diffusion steps will not yield the gains we have observed, and beam search is essential to achieving better results.
- We added more list methods, such as SCL and OSD, which we present in Appendix F.
We appreciate the reviewer’s comments and found them very useful. But, we also believe that the principled design of beam search is important to the ICLR community, which has had many papers on neural ECC. Even though neural methods should, in principle, beat or match classical methods, they lag behind SCL for Polar codes. Our work has closed this gap and the way we did this is valuable to the community. We also want to emphasize that our empirical results are well above the significance threshold. We outperform the state of the art in all settings, especially for longer codes and whenever there is a mismatch (for Rayleigh, we improve by a factor of approximately 100).
I thank the authors for their rebuttal and clarification. I am now convinced that the manuscript has not undergone a substantial shift in research focus. I also recognize that conditional diffusion and MBS form an integrated framework.
However, I do not consider the experimental evaluation in the revised manuscript sufficient to fully address the concerns raised in my previous comment.
Rebuttal: “We are willing to add a comparison with the masked-diffusion-based decoder that the reviewer has in mind and include it in the paper.” The comparison I have in mind is not limited to another masked-diffusion-based decoder. Neural decoders that can output bitwise probabilities could be evaluated within the same MBS framework, analogous to the compared BP-MBS (by setting the chosen input bit by +1/-1). Such comparisons would help isolate the additional value of masked-diffusion conditioning from the gains due to search. I consider this particularly important because the proposed standalone decoder generally underperforms SB-ECC.
Regarding BP-MBS, the comparison in Figure 5 covers only two code configurations, which I consider insufficient to support broad conclusions. BP-MBS may remain competitive on other codes. In particular, on CCSDS, an LDPC code, BP-MBS already performs close to the proposed method. On Polar, its weaker performance is less surprising, given that BP is not a competitive decoder on Polar codes. Its weak performance on Polar therefore does not eliminate the need for broader comparisons involving other neural decoders combined with search or list decoding.
I recognize that neural decoders can remain valuable even when they underperform conventional decoders. I am not requiring the proposed method to outperform conventional decoders like BP-MBS. However, beyond the BP-MBS comparison, I would still like to see how standard neural decoders perform when combined with MBS.
Rebuttal “Regarding more extensive experiments, we provide tail statistics in Appendix K.2.” This remains my main concern. The appendix reports computational-work estimates and mean decoding times, but its beam-usage percentiles do not directly characterize actual tail latency. Furthermore, the end-to-end timing evaluation is limited to CCSDS(128,64), providing limited evidence about computational costs across code families.
Moreover, at 4 dB, Appendix K.2 explicitly reports that only 9 of the 1000 sampled frames activated MBS, which is consist with the reported number in Table 1 - Diffusion. The timing sample therefore contains very few search-triggering frames, potentially providing even fewer observations of rare, expensive search trajectories. This raises concerns about whether the sample adequately captures the search overhead and whether the reported mean costs are statistically stable. Larger samples, uncertainty estimates, and separate latency statistics for search-triggering frames would help assess these questions.
Finally, the runtime estimates in Appendix K.1 use RTX A5000 measurements, whereas the end-to-end timings in Appendix K.2 use an H200. Although the reason for using different devices is unclear to me, I respect the authors’ choice of experimental setup.
Rebuttal “Based on our experiments and communication with the SB-ECC authors”. I am not alleging a violation of the double-blind review policy. However, I consider this inappropriate.
Overall, my main concerns are:
- Whether masked diffusion is necessary for the reported performance gains.
- The need for a more comprehensive evaluation of MBS, particularly regarding computational complexity and decoding latency.
This work undoubtedly has the potential for publication at a top-tier conference such as ICLR. However, for the reasons discussed above, my overall assessment remains borderline, leaning toward weak reject. I leave the final decision to the Area Chair.
Response to Reviewer MRCf
W1. Whether the sampled loss in Eq. (11) is unbiased for Eq. (7)
We thank the reviewer for pointing this out. Submitted Eq. (11) omitted the masked-mean normalization 1/∣M∣, now corrected in Eq. (10). Although we did not explicitly claim unbiasedness, we agree that the connection requires clarification.
Appendix B shows that forcing a singleton when the mask is empty introduces an O(1/n) bias relative to the per-bit conservation-law. It derives the exact bias in Eq. (22) and an exactly unbiased mask-size reweighting in Eq. (23), retaining all masked labels. The reported training loss remains the unweighted version.
Changes to the manuscript:
W2. Standalone masked diffusion versus SB-ECC and DDECC
We agree that standalone masked diffusion generally performs worse than SB-ECC and, in some settings, DDECC. Most of our performance gain comes from beam search. Our conditional formulation separates physical-channel noise from auxiliary diffusion noise, allowing us to choose masking and construct a principled search over partial assignments. Our goal is to extend the mechanism of SCL decoding to a broader range of codes, accepting weaker single-path performance in exchange for better overall decoding performance.
The SC-to-SCL comparison illustrates this motivation. SC uses exact recursive bit-channel likelihood calculations rather than a learned model, yet without a list it performs worse than the neural methods in Figure 1. Retaining alternative decisions substantially improves performance toward the ML reference: exact probability calculations alone do not eliminate the limitations of committing to one path.
Single-path performance also depends on the reveal order. In unpublished follow-up work, optimizing the reveal schedule with reinforcement learning while keeping the released model weights fixed improved performance. For Polar$(128,64)$ at Eb/N0=4dB, the negative log BER was 6.69 with random eight-bit reveals, 7.63 with confidence-based eight-bit reveals, and 9.1 with the optimized schedule, compared with 9.03 for SB-ECC. We share the unpublished RL results only to further emphasize the role of the decoding path. The comparison between random and confidence-based reveal orders already demonstrates this dependence using the same model weights and eight-bit reveal steps. Thus, weaker single-path performance does not by itself imply a poor posterior model.
As noted in our response to Reviewer 3Uou, we corrected the syndrome embedding to match CrossMPT (Park et al., 2025) and reran the experiments, including parity-based early exits. The revised results improve, but SB-ECC still has lower BER than our standalone decoder in 39 of the 42 comparisons in Table 1.
Changes to the manuscript: