Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Electronics

CrossMPM: Cross-Selective Scan Message-Passing Mamba for Short-Length LDPC Codes

Yoonju Cho, Junghyun Kim

Published Oct 28, 2026• 0 citations
Publisher

Abstract

Error-correcting codes (ECCs) are fundamental to reliable communication over noisy channels. Transformer-based neural decoders achieve strong ECC decoding performance, but attention operations cause computational complexity to grow substantially with code length. We propose Cross-Selective Scan Message-Passing Mamba (CrossMPM), a low-complexity Mamba-based neural decoder, to address this issue. CrossMPM replaces cross-attention-based information exchange between magnitude and syndrome vectors in Cross-Attention Message-Passing Transformer (CrossMPT) with Tanner-graph projection and Cross-Selective Scan State-Space Model (Cross-Selective Scan SSM). Tanner-graph projection aggregates connected node representations according to the parity-check matrix to incorporate code structure, while Cross-Selective Scan SSM dynamically generates selection parameters from the aggregated representations to control state updates and outputs. CrossMPM thus models local parity constraints and long-range dependencies without attention operations and reduces computational complexity. Simulation results show that CrossMPM achieves competitive decoding performance with lower computational complexity than CrossMPT and Hybrid Mamba-Transformer Decoder (ECCM), and this performance is maintained at longer code lengths. These results show that CrossMPM provides a favorable trade-off between error correction performance and computational efficiency.

DOI
10.3390/electronics15214986

Related papers

CrossMPT: Cross-attention Message-Passing Transformer for Error Correcting Codes

Seong‐Joon Park, Kwak, Hee-Youl, Sang‐Hyo Kim +2 more

Error correcting codes (ECCs) are indispensable for reliable transmission in communication systems. The recent advancements in deep learning have catalyzed the exploration of ECC decoders based on neural networks. Among these, transformer-based neural decoders have achieved state-of-the-art decoding performance. In this paper, we propose a novel Cross-attention Message-Passing Transformer (CrossMPT), which shares key operational principles with conventional message-passing decoders. While conventional transformer-based decoders employ self-attention mechanism without distinguishing between the types of input vectors (i.e., magnitude and syndrome vectors), CrossMPT updates the two types of input vectors separately and iteratively using two masked cross-attention blocks. The mask matrices are determined by the code's parity-check matrix, which explicitly captures the irrelevant relationship between two input vectors. Our experimental results show that CrossMPT significantly outperforms existing neural network-based decoders for various code classes. Notably, CrossMPT achieves this decoding performance improvement, while significantly reducing the memory usage, complexity, inference time, and training time.

arXiv:2405.01033•May 2, 2024•14 citations

Scalable Mamba-Based Message-Passing Neural Decoder for Error-Correcting Codes

Rostislav Gusev, Nikita Aleksandrov, Artem Solomkin +1 more

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.

arXiv:2605.10681•May 11, 2026•0 citations

E2E DC-CrossMPT: Cross-Attention Message-Passing Transformer for Joint Design and Decoding of Linear Block Codes

Yeji Cho, Junghyun Kim

In this paper, we propose a novel deep learning-based framework for the joint design and decoding of linear block codes, the end-to-end deep coding cross-attention message-passing Transformer (E2E DC-CrossMPT). To improve linear block code design and decoding, we redesign the conventional error correction code (ECC) decoder, CrossMPT, to fit within an end-to-end framework. The redesigned decoder separately utilizes magnitude and syndrome vectors obtained from the received signals as inputs. It further employs one-hot encoding based syndrome embedding and incorporates a parity-check matrix into the output layers. Experimental results demonstrate that, across various code lengths and code rates, E2E DC-CrossMPT consistently outperforms both traditional decoding algorithms and a conventional end-to-end deep coding model in terms of decoding performance. Moreover, the codes designed by E2E DC-CrossMPT achieve superior error-correction capability compared with both traditional linear block codes and those designed by the conventional end-to-end deep coding model, while requiring lower computational complexity.

Electronics•Jun 25, 2026•1 citation

Cross-Attention Message-Passing Transformers for Code-Agnostic Decoding in 6G Networks

Seong‐Joon Park, Kwak, Hee-Youl, Sang‐Hyo Kim +2 more

Channel coding for 6G networks is expected to support a wide range of requirements arising from heterogeneous communication scenarios. These demands challenge traditional code-specific decoders, which lack the flexibility and scalability required for next-generation systems. To tackle this problem, we propose an AI-native foundation model for unified and code-agnostic decoding based on the transformer architecture. We first introduce a cross-attention message-passing transformer (CrossMPT). CrossMPT employs two masked cross-attention blocks that iteratively update two distinct input representations-magnitude and syndrome vectors-allowing the model to effectively learn the decoding problem. Notably, our CrossMPT has achieved state-of-the-art decoding performance among single neural decoders. Building on this, we develop foundation CrossMPT (FCrossMPT) by making the architecture invariant to code length, rate, and class, allowing a single trained model to decode a broad range of codes without retraining. To further enhance decoding performance, particularly for short blocklength codes, we propose CrossMPT ensemble decoder (CrossED), an ensemble decoder composed of multiple parallel CrossMPT blocks employing different parity-check matrices. This architecture can also serve as a foundation model, showing strong generalization across diverse code types. Overall, the proposed AI-native code-agnostic decoder offers flexibility, scalability, and high performance, presenting a promising direction to channel coding for 6G networks.

arXiv:2507.01038•Jun 22, 2025•1 citation

A Transformer Decoder with Tanner Graph-based Positional Encoding

Xiang Shi, Chin Wa Lau, Nian Guo

Error correction codes (ECCs) are essential for reliable communication over noisy channels. While Transformer-based decoders surpass traditional methods on short and medium-length codes, they insufficiently exploit the structural information of Tanner graphs. In this paper, we propose a novel Transformer decoder with Tanner Graph-Based Positional Encoding (TGPE) which introduces a dual-level positional encoding mechanism to effectively integrate graph topology into the attention process. The intra-type encoding utilizes a distance matrix to embed shortest-path relationships among nodes of the same type, thereby enhancing the modeling of intra-group dependencies. Meanwhile, the inter-type encoding extends the differential attention mechanism by combining mask-based edge connectivity—derived from the parity-check matrix—with a distance-modulated attention term that captures distance-aware dependencies between variable and check nodes while suppressing background attention noise. This dual encoding enables the decoder to capture both global and local, indirect and direct topological dependencies. Extensive experiments on standard ECC benchmarks demonstrate that TGPE consistently outperforms previous methods including BP, ECCT and CrossMPT. Moreover, interpretability analysis confirms that the learned distance encodings reflect theoretical coding principles, with smaller graph distances corresponding to stronger correlations, highlighting TGPE’s robustness and theoretical soundness.

International Conference on Communications•May 24, 2026•0 citations

Optimizing LDPC Decoding with Machine Learning Using Learnable Weights: A Hybrid Framework Integrating Neural Networks with Iterative Message-Passing for Enhanced Error-Correction in 5G Systems

Niklas Savijoki

This thesis investigates the optimization of Low-Density Parity-Check (LDPC) decoding through machine learning techniques, with a specific focus on 5G communication systems. Traditional LDPC decoding algorithms face a critical trade-off: Belief Propagation (BP) offers excellent error-correction performance but with high computational complexity, while Min-Sum (MS) reduces complexity at the cost of degraded performance. To address this limitation, a hybrid neural network architecture is proposed that incorporates learnable normalization and offset weights into the message-passing framework of LDPC decoders. This approach integrates multiplicative (normalization) and additive (offset) weights into the Tanner graph structure, allowing the decoder to adapt to specific channel conditions. A novel weighted binary cross-entropy loss function is developed that prioritizes entire block recovery by assigning different importance to information and parity bits during training. Experimental results demonstrate that ML-assisted decoder consistently outperforms conventional Min-Sum decoding, approaching the error-correction capability of Belief Propagation while maintaining comparable computational efficiency to Min-Sum. Comprehensive evaluations across different weight configurations (scalar and vector-based) reveal that increased parametrization generally improves decoding performance. Analysis of the impact of iteration counts shows that the optimal number of decoding iterations varies between different code configurations with studied Basegraph 1 case requiring 15 iterations for optimal performance while studied Basegraph 2 case benefits significantly from 20 iterations. The proposed ML-assisted LDPC decoder represents a significant advancement for 5G systems, offering improved error correction at lower signal strengths while balancing latency and computational requirements. This research contributes to the ongoing evolution of wireless technology by demonstrating how machine learning can effectively enhance traditional decoding algorithms, providing a practical pathway toward more efficient and adaptive error correction in modern communication systems.

•Jan 1, 2025•0 citations
Error-correcting codes (ECCs) are fundamental to reliable communication over noisy channels. Transformer-based neural decoders achieve strong ECC decoding performance, but attention operations cause computational complexity to grow substantially with code length. We propose Cross-Selective Scan Message-Passing Mamba (CrossMPM), a low-complexity Mamba-based neural decoder, to address this issue. CrossMPM replaces cross-attention-based information exchange between magnitude and syndrome vectors in Cross-Attention Message-Passing Transformer (CrossMPT) with Tanner-graph projection and Cross-Selective Scan State-Space Model (Cross-Selective Scan SSM). Tanner-graph projection aggregates connected node representations according to the parity-check matrix to incorporate code structure, while Cross-Selective Scan SSM dynamically generates selection parameters from the aggregated representations to control state updates and outputs. CrossMPM thus models local parity constraints and long-range dependencies without attention operations and reduces computational complexity. Simulation results show that CrossMPM achieves competitive decoding performance with lower computational complexity than CrossMPT and Hybrid Mamba-Transformer Decoder (ECCM), and this performance is maintained at longer code lengths. These results show that CrossMPM provides a favorable trade-off between error correction performance and computational efficiency.
Error correcting codes (ECCs) are indispensable for reliable transmission in communication systems. The recent advancements in deep learning have catalyzed the exploration of ECC decoders based on neural networks. Among these, transformer-based neural decoders have achieved state-of-the-art decoding performance. In this paper, we propose a novel Cross-attention Message-Passing Transformer (CrossMPT), which shares key operational principles with conventional message-passing decoders. While conventional transformer-based decoders employ self-attention mechanism without distinguishing between the types of input vectors (i.e., magnitude and syndrome vectors), CrossMPT updates the two types of input vectors separately and iteratively using two masked cross-attention blocks. The mask matrices are determined by the code's parity-check matrix, which explicitly captures the irrelevant relationship between two input vectors. Our experimental results show that CrossMPT significantly outperforms existing neural network-based decoders for various code classes. Notably, CrossMPT achieves this decoding performance improvement, while significantly reducing the memory usage, complexity, inference time, and training time.
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.
In this paper, we propose a novel deep learning-based framework for the joint design and decoding of linear block codes, the end-to-end deep coding cross-attention message-passing Transformer (E2E DC-CrossMPT). To improve linear block code design and decoding, we redesign the conventional error correction code (ECC) decoder, CrossMPT, to fit within an end-to-end framework. The redesigned decoder separately utilizes magnitude and syndrome vectors obtained from the received signals as inputs. It further employs one-hot encoding based syndrome embedding and incorporates a parity-check matrix into the output layers. Experimental results demonstrate that, across various code lengths and code rates, E2E DC-CrossMPT consistently outperforms both traditional decoding algorithms and a conventional end-to-end deep coding model in terms of decoding performance. Moreover, the codes designed by E2E DC-CrossMPT achieve superior error-correction capability compared with both traditional linear block codes and those designed by the conventional end-to-end deep coding model, while requiring lower computational complexity.
Channel coding for 6G networks is expected to support a wide range of requirements arising from heterogeneous communication scenarios. These demands challenge traditional code-specific decoders, which lack the flexibility and scalability required for next-generation systems. To tackle this problem, we propose an AI-native foundation model for unified and code-agnostic decoding based on the transformer architecture. We first introduce a cross-attention message-passing transformer (CrossMPT). CrossMPT employs two masked cross-attention blocks that iteratively update two distinct input representations-magnitude and syndrome vectors-allowing the model to effectively learn the decoding problem. Notably, our CrossMPT has achieved state-of-the-art decoding performance among single neural decoders. Building on this, we develop foundation CrossMPT (FCrossMPT) by making the architecture invariant to code length, rate, and class, allowing a single trained model to decode a broad range of codes without retraining. To further enhance decoding performance, particularly for short blocklength codes, we propose CrossMPT ensemble decoder (CrossED), an ensemble decoder composed of multiple parallel CrossMPT blocks employing different parity-check matrices. This architecture can also serve as a foundation model, showing strong generalization across diverse code types. Overall, the proposed AI-native code-agnostic decoder offers flexibility, scalability, and high performance, presenting a promising direction to channel coding for 6G networks.
Error correction codes (ECCs) are essential for reliable communication over noisy channels. While Transformer-based decoders surpass traditional methods on short and medium-length codes, they insufficiently exploit the structural information of Tanner graphs. In this paper, we propose a novel Transformer decoder with Tanner Graph-Based Positional Encoding (TGPE) which introduces a dual-level positional encoding mechanism to effectively integrate graph topology into the attention process. The intra-type encoding utilizes a distance matrix to embed shortest-path relationships among nodes of the same type, thereby enhancing the modeling of intra-group dependencies. Meanwhile, the inter-type encoding extends the differential attention mechanism by combining mask-based edge connectivity—derived from the parity-check matrix—with a distance-modulated attention term that captures distance-aware dependencies between variable and check nodes while suppressing background attention noise. This dual encoding enables the decoder to capture both global and local, indirect and direct topological dependencies. Extensive experiments on standard ECC benchmarks demonstrate that TGPE consistently outperforms previous methods including BP, ECCT and CrossMPT. Moreover, interpretability analysis confirms that the learned distance encodings reflect theoretical coding principles, with smaller graph distances corresponding to stronger correlations, highlighting TGPE’s robustness and theoretical soundness.
This thesis investigates the optimization of Low-Density Parity-Check (LDPC) decoding through machine learning techniques, with a specific focus on 5G communication systems. Traditional LDPC decoding algorithms face a critical trade-off: Belief Propagation (BP) offers excellent error-correction performance but with high computational complexity, while Min-Sum (MS) reduces complexity at the cost of degraded performance. To address this limitation, a hybrid neural network architecture is proposed that incorporates learnable normalization and offset weights into the message-passing framework of LDPC decoders. This approach integrates multiplicative (normalization) and additive (offset) weights into the Tanner graph structure, allowing the decoder to adapt to specific channel conditions. A novel weighted binary cross-entropy loss function is developed that prioritizes entire block recovery by assigning different importance to information and parity bits during training. Experimental results demonstrate that ML-assisted decoder consistently outperforms conventional Min-Sum decoding, approaching the error-correction capability of Belief Propagation while maintaining comparable computational efficiency to Min-Sum. Comprehensive evaluations across different weight configurations (scalar and vector-based) reveal that increased parametrization generally improves decoding performance. Analysis of the impact of iteration counts shows that the optimal number of decoding iterations varies between different code configurations with studied Basegraph 1 case requiring 15 iterations for optimal performance while studied Basegraph 2 case benefits significantly from 20 iterations. The proposed ML-assisted LDPC decoder represents a significant advancement for 5G systems, offering improved error correction at lower signal strengths while balancing latency and computational requirements. This research contributes to the ongoing evolution of wireless technology by demonstrating how machine learning can effectively enhance traditional decoding algorithms, providing a practical pathway toward more efficient and adaptive error correction in modern communication systems.