- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper presents an RL method for constructing a binary parity check matrix for an error correcting code. The algorithm begins with an all-zero matrix, flips a zero to a one at random (or alternatively, adds an edge to the respective Tanner graph), and checks BER in the binary symmetric channel via belief propagation (I assume via repeated sampling of the noise, and running BP a certain amount of steps); that BER serves as the RL reward function, and the results are logged. Every certain number of steps, that log is used to train a function f which dictates the next edge to be flipped, and a function g which estimates the reward. The technique is also compatible with applying various constraints on the parity check matrix, such avoiding 4-cycles in the Tanner graph (known to negatively affect decoding success probability).
Critical strengths
- Clear and concise presentation of the solution.
- State-of-the-art performance in several parameter regimes.
- The idea of using the buffer D to train the RL module is nice.
Critical weaknesses
-
Limited novelty – The paper appears to be a straightforward application of known RL methods to the problem of constructing parity-check matrices compatible with belief propagation decoding.
-
Limited scope – a. The authors demonstrate improved BER over existing method in a very narrow set of parameters (n,n/2), with four possible values of n. b. The reward system is based exclusively on BP decoding. c. Insufficient comparison to other code techniques such as polar coding; some preliminary results are given in Appendix D, but I had trouble following what’s being done, or what is the equally-well-performing AI-coding method.
-
The paper appears to present some good methodologies in terms of constructing error correcting codes for certain parameters while optimizing success of certain decoding algorithms, but lacks a generalizable method or theoretical insights that might be applied elsewhere.
-
As such, perhaps this paper might be of little interest to the ICLR community, and might be better suited to an IEEE journal in this area.
Questions for authors
- The paper presents results for a very limited set of parameters. Is there a reason why this set of parameters is important, insightful, or crucial for certain application? Otherwise, is there a reason not to attempt this method for many other parameters?
- Are there any generalizable insights which could be drawn from the paper, which might be applicable elsewhere?
- Are there any form of rigorous guarantees or theoretical statements that could be established about, say, the success probability of your approach, or of the code it produces?
- Is there a reason that the algorithm only adds edges to the tanner graph, rather than removing them?
Some minor comments about presentation:
-
Slight confusion: an “edge” is an element of the Tanner graph which correspond to a given parity check matrix, not an element of the matrix itself. As such, I was confused multiple times about what it means to, say, add an edge to a matrix.
-
“valid when it has full rank over GF(2) and contains neither an all-zero row” – The word “and” here is imprecise since a full rank matrix cannot have an all-zero row.
-
How is BER computed in (3)? Even if this is standard averaging, please say so.
10 comments
Experimental Scope
Reviewer comment
Limited scope – a. The authors demonstrate improved BER over existing method in a very narrow set of parameters (n,n/2), with four possible values of n. b. The reward system is based exclusively on BP decoding. c. Insufficient comparison to other code techniques such as polar coding; some preliminary results are given in Appendix D, but I had trouble following what's being done, or what is the equally-well-performing AI-coding method.
The paper presents results for a very limited set of parameters. Is there a reason why this set of parameters is important, insightful, or crucial for certain application? Otherwise, is there a reason not to attempt this method for many other parameters?
Response
Code rates and comparison scope
We chose rate because it is the most representative setting for evaluating short-block code design, and prior studies have primarily been evaluated in this regime: Tian et al. (2025) reported results for , and Dufrène et al. (2025) reported results for , , and . Following these settings enables a direct comparison with existing methods.
However, nothing in ZeroCode is specific to this choice; the code rate and block length are simply input parameters and can be changed freely. In Section 5.6, we constructed a PCM under the structural constraints of the rate- 5G LDPC code and achieved a gain of more than 2 dB over the 5G LDPC code at . In addition, we constructed PCMs with ZeroCode for the and codes, corresponding to code rates and , and compared them with the Classical, DL, and GA baselines under identical decoding settings. The table below reports the BER at dB.
| Classical | DL | GA | ZeroCode | |
|---|---|---|---|---|
Whereas the relative performance of the other methods varies substantially with the code rate, ZeroCode maintains a consistently low BER across both code rates.
BP-decoding-based reward
The reward in ZeroCode is not tied to a specific decoder; any error rate measured by a given decoder can be used. In the main text, we used BP as a representative example, and in the polar-code experiment in the Appendix, we used the FER measured by an SCL decoder as the reward. Furthermore, following your comment, to verify operation with a non-BP decoder, we constructed a new code over a binary symmetric channel using the FER measured by a hard-decision bit-flipping (BF) decoder as the reward. When evaluated with the same BF decoder, ZeroCode achieves a lower FER than both Reed–Muller (RM) and extended quadratic-residue (QR) codes across the entire evaluated range. We have added these results to Appendix E Figure 10c of the revised manuscript.
| RM | Extended QR | ZeroCode | |
|---|---|---|---|
| 7 | |||
| 8 | |||
| 9 |
Polar-code experimental setup and comparison method
Our description of Appendix D in the submitted manuscript was insufficient. This preliminary experiment examines whether the sequential selection approach used for PCM construction can also be applied to polar-code construction. Constructing a polar code requires selecting 64 information-bit positions out of 128 input positions. ZeroCode starts with no positions selected and, at each step, adds one unselected position to the information-bit set. Construction terminates once 64 positions have been selected, and the remaining 64 positions become frozen-bit positions. Thus, in this experiment, the policy learns which positions to assign as information bits.
The AI-based method that achieved comparable performance to ZeroCode is AI Coding (Huang et al., 2020), which searches for the information-bit set by applying crossover and mutation to existing candidate sets via a genetic algorithm. In Figure 10b, we compare the FER curve of the ZeroCode polar code against that reported by Huang et al. (2020); ZeroCode matches the performance of AI Coding, and both outperform the conventional construction methods PW and DE/GA. We have clarified this experimental setup and comparison procedure in Appendix E of the revised manuscript.
Generalizable Insights
Reviewer comment
The paper appears to present some good methodologies in terms of constructing error correcting codes for certain parameters while optimizing success of certain decoding algorithms, but lacks a generalizable method or theoretical insights that might be applied elsewhere.
Are there any generalizable insights which could be drawn from the paper, which might be applicable elsewhere?
Response
While this work focuses on PCM design, a PCM is equivalent to the edge configuration of a Tanner graph, making ZeroCode fundamentally a graph-optimization method. This is analogous to AlphaChip, which places components one by one onto an empty canvas; both methods permit only feasible selections given the current state, evaluate the outcome at each step, and construct a solution incrementally. To our knowledge, ZeroCode is the first work to apply this paradigm to PCM design. Accordingly, the same framework can be applied to general graph-optimization problems that require deciding pairwise connections sequentially to optimize an objective while satisfying structural constraints such as degree bounds, cycle constraints, and symmetry. In particular, the ability to enforce diverse constraints via action masking without altering the training procedure offers broader insights for graph optimization, and the same principle can be extended to sequential discrete decision problems in communications such as pilot assignment or antenna selection. Thank you for this insightful question that encouraged us to view our work from a broader perspective.
Novelty and Key Contributions
Thank you very much for your thoughtful questions regarding the significance and extensibility of our work. Based on your comments, we clarify how our contributions apply to other construction problems as well as the current scope of our evaluation.
Reviewer comment
Response
A straightforward application of RL does not work well for this problem. The prior RL-based construction (DDPG) underperformed classical constructions, and simply replacing DDPG with PPO even degraded performance (Table 1). ZeroCode overcomes this through a new problem formulation and domain-informed action masking, and we summarize our contributions from three perspectives.
1. Problem formulation: learning a sequential PCM construction policy guided by decoding performance
ZeroCode formulates PCM construction as a discrete sequential decision-making problem, adding one edge at a time from the all-zero matrix and using the decoding performance of each partial matrix as the reward. Inspired by AlphaChip (Mirhoseini et al., 2021), which places components sequentially onto an empty canvas, ZeroCode learns the entire construction trajectory toward high-performing codes without relying on a pre-constructed PCM.
Table 1 shows the importance of this formulation. Replacing DDPG with PPO alone increased the BER from 1.0×10−3 to 2.1×10−3, whereas the largest gain came from shifting from modifying a pre-constructed PCM to constructing one from the all-zero matrix. This shows that how the construction problem is formulated is as critical as the choice of RL algorithm. Moreover, because intermediate PCMs are also optimized, this process yields a library of codes spanning different edge counts and decoding complexities.
2. Action masking: incorporating channel-coding domain knowledge into construction
ZeroCode uses action masking to embed channel-coding domain knowledge directly into the search, for example by preventing 4-cycles, which degrade BP performance, or by preserving a QC structure. This optimizes decoding performance while satisfying structural constraints by construction, without modifying the training procedure, and provides a foundation for integrating other established code-design principles into RL.
3. Performance: empirical gains beyond classical construction methods
LDPC code design has long relied on classical constructions grounded in coding theory. To the best of our knowledge, ZeroCode is the first RL-based PCM construction method to outperform classical constructions across multiple block lengths. This shows that RL, combined with an appropriate problem formulation and domain knowledge, is effective for practical code design. Furthermore, ZeroCode supports optimization under diverse structural constraints, which is difficult for classical methods, and is expected to be useful for designing high-performing codes in emerging domains such as quantum computing, data storage, and cryptography.