Metraipolis › archive › dc_ef106777e427
ZeroCode: On-demand Error-Correcting Code Construction from the Zero Matrix via Reinforcement Learning — arXiv:2609.34265
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.34265
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T22:38:07.650Z
- SHA-256 of the archived text
a96fc512f25194a4aa96397a2f77bf362248b709fd6ccb6c992dcd5c0d8f133e- Stable URL of this page
https://metraipolis.com/documento/dc_ef106777e427
How to cite
ZeroCode: On-demand Error-Correcting Code Construction from the Zero Matrix via Reinforcement Learning — arXiv:2609.34265 — arXiv (en), https://arxiv.org/abs/2609.34265 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ef106777e427 (Metraipolis archive dc_ef106777e427, sha256 a96fc512f25194a4aa96397a2f77bf362248b709fd6ccb6c992dcd5c0d8f133e)
BibTeX
@misc{dcef106777e427,
title = {ZeroCode: On-demand Error-Correcting Code Construction from the Zero Matrix via Reinforcement Learning — arXiv:2609.34265},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.34265},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ef106777e427; sha256 a96fc512f25194a4aa96397a2f77bf362248b709fd6ccb6c992dcd5c0d8f133e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.34265. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Error-correcting codes (ECCs) are essential across diverse applications, from wireless communications and storage to quantum computing, yet each application imposes distinct design requirements on the parity-check matrix (PCM). To address these on-demand requirements in a unified framework, we propose ZeroCode, a reinforcement learning (RL)-based approach that constructs PCMs sequentially from the all-zero matrix. ZeroCode formulates construction as a discrete sequential decision-making problem and uses proximal policy optimization with action masking to select valid edges. ZeroCode achieves a gain of approximately 1 dB over the prior RL-based construction method at a bit error rate (BER) of $10^{-4}$ for the (32,16) code and outperforms existing genetic, differentiable, and classical code-design methods in our experiments. Beyond optimizing decoding performance, the masking mechanism allows on-demand structural constraints, such as a maximum degree, 4-cycle-free structure, and quasi-cyclic structure, to be flexibly incorporated. Moreover, a single policy rollout yields a library of PCMs with varying edge counts, offering trade-offs between decoding performance and complexity without retraining. Overall, ZeroCode addresses diverse code-design requirements within a unified framework, providing solutions with optimized decoding performance under given constraints.
Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-29 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.34265 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T22:14:28.145Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).