- Rating
- 4
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
Main Idea: The paper extends neural belief propagation by replacing scalar messages with high-dimensional vectors. Variable-to-check updates use learned linear transformations to mix information across dimensions, while check-to-variable updates retain the familiar BP sum-product operation independently within each dimension. A learned readout converts these vectors into bit decisions. The goal is to improve decoding through richer message representations while retaining BP’s structured, relatively efficient computation. Overall, I feel this is a genuinely new and interesting idea.
Perhaps the most striking part is the evaluation and the gains appear to be substantial. Authors test E-NBP across several code families (including BCH, Polar, LDPC etc), and show a) reduced BER across a broad range of SNR values; while b) reduced flops.
Critical strengths
- Idea is clean and seems novel. There is substantial interest in designing low-complexity error correcting codes for a wide variety of applications and the approach seems to be generally applicable.
- Easy to implement and shows gains in terms of performance (reduced BER) and complexity (lower FLOPS) in a wide range of conditions.
- Paper is written very well (though this is expected these days from a good paper :)
Critical weaknesses
None.
Questions for authors
-
Choosing the message dimension: It would be good if authors can provide practical guidance for selecting d when applying E-NBP to a new code family, particularly how to balance dimension against the number of decoding iterations under a fixed computational budget? The dimension–iteration ablations are helpful, but it remains a bit unclear how the preferred choice depends on the code’s Tanner-graph structure.
-
Intuition for when dimensionality expansion helps: Could the authors elaborate on when vector-valued messages are expected to provide the largest gains over scalar BP—for example, whether the benefit is particularly pronounced in graphs with short cycles, where correlated messages can contribute to persistent decoding errors? I am very interested in understanding "why" this helps; not just the empirical results themselves. Bringing the relevant insights and analysis from the appendix (which has some discussion) earlier into the main paper would strengthen the motivation and help readers understand why the proposed expansion is effective. If I missed a discussion sitting something else, please do point out!!
3 comments
Why Dimensionality Expansion Helps (Q2)
Reviewer comment
Intuition for when dimensionality expansion helps: Could the authors elaborate on when vector-valued messages are expected to provide the largest gains over scalar BP—for example, whether the benefit is particularly pronounced in graphs with short cycles, where correlated messages can contribute to persistent decoding errors? I am very interested in understanding "why" this helps; not just the empirical results themselves. Bringing the relevant insights and analysis from the appendix (which has some discussion) earlier into the main paper would strengthen the motivation and help readers understand why the proposed expansion is effective. If I missed a discussion sitting something else, please do point out!!
Response
We thank the reviewer for this thoughtful question. Due to the page limit, we were unable to move the existing appendix discussions into the main text. Instead, we strengthened the main text with a new case study that directly illustrates why dimension expansion helps, presented in Section 6.1 and the newly added Figure 5.
Specifically, on BCH(63,45), we analyze a frame that NBP fails to decode but E-NBP recovers, with the same six iterations. In this frame, we select two VNs that form a 4-cycle and compare the final LLRs of NBP with the dimension-wise readout contributions of E-NBP. This shows how the correct-direction contributions of some dimensions outweigh the incorrect-direction contributions of others, flipping the final decision to the correct one. This provides an intuitive explanation of why vector messages help: whereas a scalar message on a short cycle can only reinforce a single, possibly wrong belief, vector messages allow different dimensions to carry complementary evidence.
Regarding when the gains are largest, we observe that E-NBP provides similar gains over scalar BP across codes regardless of the number of short cycles in their Tanner graphs. We believe this rather highlights the universality of E-NBP: the benefit of vector messages is not limited to a particular graph structure, but extends consistently across diverse code families.
Related discussions can also be found in the following parts of the paper:
- Section 6.1, Figure 5(b): E-NBP recovers more low-weight residual errors, which are commonly associated with trapping sets, than NBP and CrossMPT.
- Appendix E, Figure 8: Different message dimensions dominate error correction at different iterations, showing that the dimensions play distinct roles.
- Appendix F, Proposition 3 / Figure 9 (heatmaps, off-diagonal energy): E-NBP learns cross-dimensional coupling rather than acting as an ensemble of independent scalar decoders.
Closing Remarks
We thank the reviewer for the positive evaluation and the insightful questions on the practical use and underlying mechanism of E-NBP. Specifically, we have made the following revisions:
- We added iteration–dimension comparisons on LDPC(49,24) and Polar(64,32), and provided practical guidance for choosing the configuration under a given compute budget.
- We added a case study (Section 6.1, Figure 5) illustrating why vector messages help, showing how complementary contributions from different dimensions correct errors on a 4-cycle where scalar NBP fails.
- We clarified that E-NBP provides consistent gains regardless of the number of short cycles, and pointed to the related analyses in Figure 5(b), Appendix E, and Appendix F.
In addressing the reviewer's comments, we were able to provide clearer practical guidance and a more intuitive understanding of why dimension expansion is effective. We hope that our responses further strengthen the reviewer's positive assessment of our work.
We sincerely thank the reviewer for the time and effort devoted to providing a thoughtful and constructive review.
Choosing Message Dimension and Iteration Count (Q1)
Reviewer comment
Response
We thank the reviewer for the positive evaluation of our work and for the insightful questions on practical use and the underlying mechanism. These comments led us to consider not only how E-NBP improves performance, but also how users can choose its configuration and understand the effect of dimension expansion. We have addressed both aspects with an iteration–dimension comparison on additional codes and a concrete case study of error recovery.
In addition to the existing BCH(63,45) analysis (Figure 6(a)), we compared combinations of the number of iterations ℓˉ and the message dimension d on LDPC(49,24) and Polar(64,32). The table below reports BER at 5 dB and FLOPs per codeword.
All configurations satisfy ℓˉ×d=768, but their FLOPs differ due to the cost of the cross-dimensional transformations; we therefore report the actual FLOPs of each configuration. The newly trained (3,256), (16,48), and (24,32) models are evaluated at the best-validation checkpoint with early stopping, while (6,128) and (12,64) use the existing results. These results are also visualized in the iteration–dimension sweep plot.
On both codes, (12,64) achieves the lowest BER among the five configurations. More importantly, the two directions of deviation from (12,64) are highly asymmetric:
In addition, since the FLOPs of E-NBP scale as ℓˉd2, the message dimension is the more expensive axis. Figure 5(a) also shows that, once ℓˉ=12 is secured, increasing d steadily improves performance.
Practical guidance. Based on these observations, we suggest the following rule for a given compute budget:
Our main experiments follow this rule: (ℓˉ,d)=(12,64) for short codes and (10,128) for long codes.
Dependence on Tanner-graph structure. This asymmetric trend is consistently observed across BCH, LDPC, and polar codes with different Tanner-graph structures, although the magnitude of degradation varies by code. We therefore expect the above rule to serve as a reliable starting point for a new code family, followed by a comparison of nearby configurations based on the actual FLOPs and BER on its Tanner graph.