- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This work focuses on decoding concatenated codes, which combine inner and outer codes. In the main experiments, the authors use brute-force MAP/ML search to obtain an optimal inner-code estimate and its bitwise reliability (e.g., for BCH(15,5)). Since the inner codes considered have small dimensions, this setting is reasonable. The resulting reliability and outer-code syndrome are then fed into an EfficientMPT decoder to correct residual errors in the outer code, such as an RS code.
Critical strengths
-
Compared with EfficientMPT using a unified PCM for both inner and outer codes, the proposed method substantially reduces FLOPs while generally maintaining or improving BER performance.
-
The experiments cover various combinations of inner and outer codes.
Critical weaknesses
-
Since concatenated codes naturally support separate inner- and outer-code decoding, I would say the novelty of this work is incremental. The method combines brute-force inner-code MAP/ML decoding with an existing EfficientMPT decoder for the outer code.
-
The experiments show substantial FLOPs savings over EfficientMPT, while the BER gains are modest in most cases. Moreover, the practical value of these computational savings may be limited, since full-binary EfficientMPT is not a mainstream approach to decoding concatenated codes.
-
The “Classical” baseline in Table 1 uses family-matched inner decoders, while the proposed method uses optimal MAP/ML search for inner-code decoding. This comparison makes it difficult to determine how much of the performance gain comes from the inner decoder and how much comes from the neural outer decoder.
Minor
- I would not say that existing Transformer-based neural decoders “treat different code families in much the same way and can hide their structural advantages” as stated in the Abstract. Code-specific constraints are represented without loss in the parity-check matrix and reflected in the Transformer mask design. When viewed as an unrolled computation graph, the Transformer has a code-specific structure, in my opinion.
Questions for authors
Please refer to the weakness.