analiza aiqbench
This research introduces the Mamba message-passing decoder (MMPD), which replaces quadratic attention mechanisms with linear-complexity state-space blocks to enable scalable neural decoding of long error-correcting codes. By integrating bidirectional Mamba blocks into a Tanner-graph structure, MMPD achieves significant performance gains and memory reductions over existing models like CrossMPT for practical LDPC codes. The work represents a key advancement in applying efficient sequence modeling architectures to fundamental problems in quantum communication and high-reliability data transmission.
Scalable Mamba-Based Message-Passing Neural Decoder for Error-Correcting Codes
arXiv:2605.10681v2 Announce Type: replace-cross Abstract: Forward error correction is essential for reliable communication over noisy channels. Attention-based model-free neural decoders have shown strong performance for short codes, but their scalability to longer codes is limited by the quadratic memory and computational cost of attention. In this paper, we introduce the Mamba message-passing decoder (MMPD), an attention-free syndrome-based neural decoder for binary linear codes. MMPD retains the Tanner-graph structure of a message-passing decoder by performing local pairwise aggregation along variable-check edges. To enable efficient long-range information propagation, these local updates are combined with bidirectional Mamba state-space blocks. By avoiding dense attention matrices, MMPD scales more favorably for long codes in both memory and computation. Experiments on the (1056, 880) LDPC code show that MMPD achieves a 0.45 dB gain over the state-of-the-art CrossMPT decoder at a specified target bit error rate, while reducing memory consumption by a factor of 1.5. This reduction factor increases substantially for longer codes, demonstrating the applicability of MMPD to scalable neural decoding of practical long codes.
Abstract:Forward error correction is essential for reliable communication over noisy channels. Attention-based model-free neural decoders have shown strong performance for short codes, but their scalability to longer codes is limited by the quadratic memory and computational cost of attention. In this paper, we introduce the Mamba message-passing decoder (MMPD), an attention-free syndrome-based neural decoder for binary linear codes. MMPD retains the Tanner-graph structure of a message-passing decoder by performing local pairwise aggregation along variable-check edges. To enable efficient long-range information propagation, these local updates are combined with bidirectional Mamba state-space blocks. By avoiding dense attention matrices, MMPD scales more favorably for long codes in both memory and computation. Experiments on the (1056, 880) LDPC code show that MMPD achieves a 0.45 dB gain over the state-of-the-art CrossMPT decoder at a specified target bit error rate, while reducing memory consumption by a factor of 1.5. This reduction factor increases substantially for longer codes, demonstrating the applicability of MMPD to scalable neural decoding of practical long codes.
Information Theory (cs.IT); Machine Learning (cs.LG)
arXiv:2605.10681 [cs.IT]
(or arXiv:2605.10681v2 [cs.IT] for this version)
https://doi.org/10.48550/arXiv.2605.10681 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 260 cuvinte
Subiecte conexe
[AINews] High Taste Testers Ep. 1
Latent Space · 17 oct. 2026

News
Quantum Computing Report · 25 iul. 2026
Learning to Decode Concatenated Quantum Codes with Hierarchical Message Passing
arXiv · 31 aug. 2026

Streaming Belief Propagation on Mixed-Alphabet Tanner Graphs for Practical Quantum Memory
Quantum Journal · 10 sept. 2026