- Rating
- 2
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes CAL-ECC, which combines a CrossMPT-based masked diffusion generator, adaptive beam search, and two maximum-likelihood (ML) optimality certificates based on LP duality and minimum-distance arguments. The authors evaluate the method on 15 codes across five SNR points, achieving the best BER in 71 out of 75 comparisons and approaching exact ML decoding performance on several codes.
Critical strengths
- The learning framework proposed by the authors is quite innovative.
- The experimental results are strong compared with the selected baselines.
- The proposed validation method is correct.
I acknowledge the strong experimental results. However, I have concerns regarding the actual sources of the performance improvements, the selection of baselines, the theoretical novelty, and the practical value of the ML certification mechanism.
Critical weaknesses
-
The paper adopts CrossMPT as its neural network backbone. However, the ablation experiments show that most of the performance improvements come from Beam Search. This leads me to believe that the performance gains of this work essentially come from a method similar to list decoding.
-
If the proposed approach is essentially similar to list decoding, comparing it mainly against ECCT, CrossMPT, DDECC, and SB-ECC is quite unfair. I believe the paper should at least include a comparison with a neural decoder equipped with a list decoding strategy. For example, one could use CrossMPT as the neural backbone and incorporate OSD/Chase-style algorithms as a baseline.
-
The training budgets are also inconsistent. CAL-ECC is trained for 2 million steps, whereas CrossMPT is trained for only 1 million steps.
-
The novelty and benefits of the ML Certification Mechanism remain unclear. I acknowledge that incorporating knowledge from classical coding theory into neural decoding is a contribution. However, I would like to understand whether this contribution merely improves performance by combining existing techniques, or whether it brings improvements to the neural network's internal computation mechanisms or architecture. For example, can the ML Certification Mechanism reduce the required training budget? Can it change or narrow the search space of Beam Search?
Questions for authors
-
Could the authors include a neural decoder with a list decoding strategy as a baseline and report its BER, BLER, and computational costs?
-
The paper considers a stopping mechanism based on ML optimality conditions. I would like to understand its advantages and disadvantages compared with syndrome-based stopping, particularly in terms of the trade-off between decoding performance and computational cost. For example, if satisfying the ML optimality conditions requires substantial additional computation, this should not necessarily be considered an advantage of ML-certified stopping.
-
Beyond simply incorporating the ML Certification Mechanism into a neural decoder, what practical benefits or changes can this mechanism bring to the neural decoder itself?
If you can clear up my doubts, I’d be more than happy to improve my score. Before this, I had quite a few doubts about the necessity and novelty of the method proposed in this paper.
Response to Reviewer hvxp
Thank you for your insightful comments and suggestions. We will improve our paper based on your comment.