- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper concerns Transformer decoding of binary error-correcting codes. FlexH constructs a parity-check representation separately for each received word: it greedily selects a full column basis in increasing order of channel-reliability magnitude, then applies invertible GF(2) row operations to turn those columns into an identity block. Applying the same transformation to the syndrome preserves the decoding constraints. The representation is computed once and held fixed throughout neural inference. This preprocessing improves decoding enough to reduce the usual FFN expansion from four to two.
Critical strengths
-
Improvements under reasonably controlled neural comparisons. The paired models use the same systematic starting matrix, depth, embedding dimension, training budget, target, and loss (Section 4.1).
-
The structure–width ablation addresses an important confound. Table 3 compares Static-H and FlexH at both 2d and 4d.
-
The parameter reduction follows directly from the narrower FFNs, and preprocessing introduces no learned parameters.
-
Insightful paper that is fun to read
Critical weaknesses
-
Comparisons with the reliability-based methods ABP [1] and OSD [2] are missing or incomplete. FlexH’s preprocessing is not an alternative to these methods but the same operation: up to tie conventions, it coincides with the first ABP adaptation step and with the dual of OSD’s most-reliable-basis elimination. The reported comparisons do not address this. ABP appears only as a standalone iterative decoder (at most 20 iterations, α = 0.1), which mixes representation, inference procedure, and training, and OSD is absent from the paper. Three plug-in comparisons are missing. First, OSD-0 produces a codeword directly from (H_y, s_y) with no learned parameters; it is the first control, followed by low-order OSD performance–cost curves on the same code constructions. Second, the ABP paper’s own variations of the reduction, degree-2 random connection and multiple groupings of the unreliable bits [1, Section IV], yield different adapted matrices that could replace FlexH’s identity form, whereas Table 3 tests only the authors’ own basis rules. Third, ABP re-adapts the matrix as reliabilities are updated, whereas FlexH freezes it, and the effect of that choice is not tested. MM-ECCT [3] is also a meaningful missing matched baseline.
-
Results are compared with the authors’ own baseline runs rather than with published numbers. ECCT, CrossMPT, and EfficientMPT are retrained by the authors from a systematic matrix, and Hyper-BP, ABP, Chase-II, and RPA are also run by the authors. The only external values are the ML references and the Cyclic CrossMPT results, which appear to be taken from its paper. No table lists the published results of the three backbones, or of other published Transformer decoders such as DM ECCT [4] and DDECC [5].
[1] J. Jiang and K. R. Narayanan, "Iterative soft-input soft-output decoding of Reed–Solomon codes by adapting the parity-check matrix," IEEE Transactions on Information Theory, vol. 52, no. 8, pp. 3746–3756, 2006. doi:10.1109/TIT.2006.878176; arXiv:cs/0506073.
[2] M. P. C. Fossorier and S. Lin, "Soft-decision decoding of linear block codes based on ordered statistics," IEEE Transactions on Information Theory, vol. 41, no. 5, pp. 1379–1396, 1995. doi:10.1109/18.412683.
[3] S.-J. Park, H.-Y. Kwak, S.-H. Kim, S. Kim, Y. Kim, and J.-S. No, "Multiple-masks error correction code transformer for short block codes," IEEE Journal on Selected Areas in Communications, vol. 43, no. 7, pp. 2518–2529, 2025. doi:10.1109/JSAC.2025.3559154.
[4] S.-J. Park, H.-Y. Kwak, S.-H. Kim, S. Kim, Y. Kim, and J.-S. No, "How to mask in error correction code transformer: Systematic and double masking," arXiv:2308.08128, 2023.
[5] Y. Choukroun and L. Wolf, "Denoising diffusion error correction codes," in International Conference on Learning Representations (ICLR), 2023. arXiv:2209.13533.
Questions for authors
Please address the weaknesses