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

arXiv:2211.06962 · International Conference on Communications

A Scalable Graph Neural Network Decoder for Short Block Codes

Kou Tian, Chentao Yue, Changyang She, Yonghui Li, Branka S. Vucetic

Published May 28, 2023• 11 citations
arXivHTMLPDF

Abstract

In this work, we propose a novel decoding algorithm for short block codes based on an edge-weighted graph neural network (EW-GNN). The EW-GNN decoder operates on the Tanner graph with an iterative message-passing structure, which algorithmically aligns with the conventional belief propagation (BP) decoding method. In each iteration, the “weight” on the message passed along each edge is obtained from a fully connected neural network that has the reliability information from nodes/edges as its input. Compared to existing deep-learning-based decoding schemes, the EW-GNN decoder is characterised by its scalability, meaning that 1) the number of trainable parameters is independent of the codeword length, and 2) an EW-GNN decoder trained with shorter/simple codes can be directly used for longer/sophisticated codes of different code rates. Furthermore, simulation results show that the EW-GNN decoder outperforms the BP and deep-learning-based BP methods from the literature in terms of the decoding error rate.

DOI
10.1109/icc45041.2023.10278711

Related papers

Graph Neural Networks for Channel Decoding

Sebastian Cammerer, Jakob Hoydis, Fayçal Ait Aoudia +1 more

In this work, we propose a fully differentiable graph neural network (GNN)-based architecture for channel decoding and showcase a competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph that represents the forward error correction (FEC) code structure by replacing node and edge message updates with trainable functions. Contrary to many other deep learning-based decoding approaches, the proposed solution enjoys scalability to arbitrary block lengths and the training is not limited by the curse of dimensionality. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results. For the (63,45) BCH code, our solution outperforms weighted belief propagation (BP) decoding by approximately 0.4 dB with significantly less decoding iterations and even for 5G NR LDPC codes, we observe a competitive performance when compared to conventional BP decoding. For the BCH codes, the resulting GNN decoder can be fully parametrized with only 9640 weights.

arXiv:2207.14742•IEEE Globecom Workshops (GC Wkshps)•Dec 4, 2022•61 citations

Deep Learning for Channel Coding

Kou Tian

Next-generation communication systems face challenges in meeting the growing demand of ultra-reliable low-latency communications (URLLC), which require advanced physical-layer designs, especially in channel coding. To satisfy the strict reliability and latency constraints of URLLC in 5G and emerging 6G networks, it is essential to use short codes with robust error-correction capabilities. This thesis explores the application of deep learning methodologies to develop advanced channel coding frameworks for short linear block codes. First, I propose a novel decoding algorithm for short block codes based on an edge-weighted graph neural network (EW-GNN). The EW-GNN decoder operates on the Tanner graph with an iterative message-passing structure, algorithmically aligning with conventional belief propagation (BP) decoding. The decoder is characterized by scalability, with trainable parameters independent of codeword length, and outperforms BP and existing deep-learning-based methods. I present a novel auto-encoder integrating deep reinforcement learning (DRL) and graph neural networks (GNN) for end-to-end channel coding. Code generation is modeled as a Markov decision process to optimize error rates and algebraic properties. An iterative joint training of the DRL-based code designer and the EW-GNN decoder is performed to optimise the end-to-end encoding and decoding process. Simulation results show significant improvements over traditional coding schemes including LDPC and BCH codes. Finally, I design a supervised learning framework using an integrated auto-encoder architecture with a systematic code generator and matrix-based adaptive double-weighted (MA-DW) decoder. This approach achieves superior performance compared to conventional systems while reducing training complexity through joint optimization of code design and decoding parameters.

•Jan 1, 2025•0 citations

GNN-Based Auto-Encoder for Short Linear Block Codes: A DRL Approach

Kou Tian, Chentao Yue, Changyang She +2 more

This paper presents a novel auto-encoder based end-to-end channel encoding and decoding. It integrates deep reinforcement learning (DRL) and graph neural networks (GNN) in code design by modeling the generation of code parity-check matrices as a Markov Decision Process (MDP), to optimize key coding performance metrics such as error-rates and code algebraic properties. An edge-weighted GNN (EW-GNN) decoder is proposed, which operates on the Tanner graph with an iterative message-passing structure. Once trained on a single linear block code, the EW-GNN decoder can be directly used to decode other linear block codes of different code lengths and code rates. An iterative joint training of the DRL-based code designer and the EW-GNN decoder is performed to optimize the end-end encoding and decoding process. Simulation results show the proposed auto-encoder significantly surpasses several traditional coding schemes at short block lengths, including low-density parity-check (LDPC) codes with the belief propagation (BP) decoding and the maximum-likelihood decoding (MLD), and BCH with BP decoding, offering superior error-correction capabilities while maintaining low decoding complexity.

arXiv:2412.02053•IEEE Transactions on Communications•Apr 29, 2025•5 citations

Hyper-Graph-Network Decoders for Block Codes

Eliya Nachmani, Lior Wolf

Neural decoders were shown to outperform classical message passing techniques for short BCH codes. In this work, we extend these results to much larger families of algebraic block codes, by performing message passing with graph neural networks. The parameters of the sub-network at each variable-node in the Tanner graph are obtained from a hypernetwork that receives the absolute values of the current message as input. To add stability, we employ a simplified version of the arctanh activation that is based on a high order Taylor approximation of this activation function. Our results show that for a large number of algebraic block codes, from diverse families of codes (BCH, LDPC, Polar), the decoding obtained with our method outperforms the vanilla belief propagation method as well as other learning techniques from the literature.

arXiv:1909.09036•Sep 5, 2019•54 citations

Intelligent LDPC Decoding Using Graph Neural Networks for Beyond 5G Communication Systems

Ambar Bajpai

With changing scenarios in Beyond 5G (B5G) systems, channel coding methods will be faced with stronger requirements for reliability, flexibility, and low latency.Conventional decoding algorithms such as Belief Propagation (BP) are efficient in structured contexts but not sufficiently flexible to respond effectively to dynamic and noisy channel conditions.In this study, we introduces a new Graph Neural Network (GNN)-based solution to decode Low-Density Parity-Check (LDPC) codes by taking advantage of the intrinsic bipartite graph representation of Tanner graphs.The proposed decoder learns a data-driven messagepassing algorithm that performs better than BP over a large range of signal-to-noise ratios (SNRs) and block lengths.The experimental results show that the GNN-based decoder yields much lower bit error rates (BER), faster convergence, and better resistance to noise variability than belief propagation, especially at medium to high SNR levels.Thus, our findings highlight the foundation for scalable, adaptive, and intelligent decoding systems in B5G and 6G architectures.

Journal of information and communication convergence engineering•Dec 31, 2025•1 citation

Unified Product GNN Decoder for Short Codes: Systematic Binary and Non-Binary Approaches

Jingjing Guo, Chentao Yue, Xuewan Zhang +2 more

Ultra-reliable and low-latency communications (URLLC) in 6 G networks pose significant challenges for channel coding, particularly where both high reliability and low latency are crucial. Deep learning–based decoders have shown promise for short codes, yet their complexity grows with code length, and their error-correction performance remains limited. This paper introduces a product graph neural network (ProductGNN) decoder that employs graph neural networks (GNN) as component decoders to enhance iterative decoding within the product code framework. The proposed unified framework supports both systematic binary product codes and non-binary product analog fountain codes (AFC), with tailored soft information exchange mechanisms between row and column decoders. The architecture maintains a parameter count independent of code length. Extrinsic information transfer (EXIT) chart analysis is conducted for ProductGNN to characterize the mutual information transfer between row and column decoders, revealing faster convergence compared to belief propagation (BP)-based iterative decoding. Numerical results demonstrate that ProductGNN consistently outperforms BP and standalone GNN decoders across multiple code families, achieving up to 2 dB gain for high-density codes affected by short cycles and up to 0.8 dB gain for non-binary AFC codes at a bit error rate (BER) of$10^{-4}$.

IEEE Transactions on Vehicular Technology•Jan 1, 2026•0 citations
In this work, we propose a novel decoding algorithm for short block codes based on an edge-weighted graph neural network (EW-GNN). The EW-GNN decoder operates on the Tanner graph with an iterative message-passing structure, which algorithmically aligns with the conventional belief propagation (BP) decoding method. In each iteration, the “weight” on the message passed along each edge is obtained from a fully connected neural network that has the reliability information from nodes/edges as its input. Compared to existing deep-learning-based decoding schemes, the EW-GNN decoder is characterised by its scalability, meaning that 1) the number of trainable parameters is independent of the codeword length, and 2) an EW-GNN decoder trained with shorter/simple codes can be directly used for longer/sophisticated codes of different code rates. Furthermore, simulation results show that the EW-GNN decoder outperforms the BP and deep-learning-based BP methods from the literature in terms of the decoding error rate.
In this work, we propose a fully differentiable graph neural network (GNN)-based architecture for channel decoding and showcase a competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph that represents the forward error correction (FEC) code structure by replacing node and edge message updates with trainable functions. Contrary to many other deep learning-based decoding approaches, the proposed solution enjoys scalability to arbitrary block lengths and the training is not limited by the curse of dimensionality. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results. For the (63,45) BCH code, our solution outperforms weighted belief propagation (BP) decoding by approximately 0.4 dB with significantly less decoding iterations and even for 5G NR LDPC codes, we observe a competitive performance when compared to conventional BP decoding. For the BCH codes, the resulting GNN decoder can be fully parametrized with only 9640 weights.
Next-generation communication systems face challenges in meeting the growing demand of ultra-reliable low-latency communications (URLLC), which require advanced physical-layer designs, especially in channel coding. To satisfy the strict reliability and latency constraints of URLLC in 5G and emerging 6G networks, it is essential to use short codes with robust error-correction capabilities. This thesis explores the application of deep learning methodologies to develop advanced channel coding frameworks for short linear block codes. First, I propose a novel decoding algorithm for short block codes based on an edge-weighted graph neural network (EW-GNN). The EW-GNN decoder operates on the Tanner graph with an iterative message-passing structure, algorithmically aligning with conventional belief propagation (BP) decoding. The decoder is characterized by scalability, with trainable parameters independent of codeword length, and outperforms BP and existing deep-learning-based methods. I present a novel auto-encoder integrating deep reinforcement learning (DRL) and graph neural networks (GNN) for end-to-end channel coding. Code generation is modeled as a Markov decision process to optimize error rates and algebraic properties. An iterative joint training of the DRL-based code designer and the EW-GNN decoder is performed to optimise the end-to-end encoding and decoding process. Simulation results show significant improvements over traditional coding schemes including LDPC and BCH codes. Finally, I design a supervised learning framework using an integrated auto-encoder architecture with a systematic code generator and matrix-based adaptive double-weighted (MA-DW) decoder. This approach achieves superior performance compared to conventional systems while reducing training complexity through joint optimization of code design and decoding parameters.
This paper presents a novel auto-encoder based end-to-end channel encoding and decoding. It integrates deep reinforcement learning (DRL) and graph neural networks (GNN) in code design by modeling the generation of code parity-check matrices as a Markov Decision Process (MDP), to optimize key coding performance metrics such as error-rates and code algebraic properties. An edge-weighted GNN (EW-GNN) decoder is proposed, which operates on the Tanner graph with an iterative message-passing structure. Once trained on a single linear block code, the EW-GNN decoder can be directly used to decode other linear block codes of different code lengths and code rates. An iterative joint training of the DRL-based code designer and the EW-GNN decoder is performed to optimize the end-end encoding and decoding process. Simulation results show the proposed auto-encoder significantly surpasses several traditional coding schemes at short block lengths, including low-density parity-check (LDPC) codes with the belief propagation (BP) decoding and the maximum-likelihood decoding (MLD), and BCH with BP decoding, offering superior error-correction capabilities while maintaining low decoding complexity.
Neural decoders were shown to outperform classical message passing techniques for short BCH codes. In this work, we extend these results to much larger families of algebraic block codes, by performing message passing with graph neural networks. The parameters of the sub-network at each variable-node in the Tanner graph are obtained from a hypernetwork that receives the absolute values of the current message as input. To add stability, we employ a simplified version of the arctanh activation that is based on a high order Taylor approximation of this activation function. Our results show that for a large number of algebraic block codes, from diverse families of codes (BCH, LDPC, Polar), the decoding obtained with our method outperforms the vanilla belief propagation method as well as other learning techniques from the literature.
With changing scenarios in Beyond 5G (B5G) systems, channel coding methods will be faced with stronger requirements for reliability, flexibility, and low latency.Conventional decoding algorithms such as Belief Propagation (BP) are efficient in structured contexts but not sufficiently flexible to respond effectively to dynamic and noisy channel conditions.In this study, we introduces a new Graph Neural Network (GNN)-based solution to decode Low-Density Parity-Check (LDPC) codes by taking advantage of the intrinsic bipartite graph representation of Tanner graphs.The proposed decoder learns a data-driven messagepassing algorithm that performs better than BP over a large range of signal-to-noise ratios (SNRs) and block lengths.The experimental results show that the GNN-based decoder yields much lower bit error rates (BER), faster convergence, and better resistance to noise variability than belief propagation, especially at medium to high SNR levels.Thus, our findings highlight the foundation for scalable, adaptive, and intelligent decoding systems in B5G and 6G architectures.
Ultra-reliable and low-latency communications (URLLC) in 6 G networks pose significant challenges for channel coding, particularly where both high reliability and low latency are crucial. Deep learning–based decoders have shown promise for short codes, yet their complexity grows with code length, and their error-correction performance remains limited. This paper introduces a product graph neural network (ProductGNN) decoder that employs graph neural networks (GNN) as component decoders to enhance iterative decoding within the product code framework. The proposed unified framework supports both systematic binary product codes and non-binary product analog fountain codes (AFC), with tailored soft information exchange mechanisms between row and column decoders. The architecture maintains a parameter count independent of code length. Extrinsic information transfer (EXIT) chart analysis is conducted for ProductGNN to characterize the mutual information transfer between row and column decoders, revealing faster convergence compared to belief propagation (BP)-based iterative decoding. Numerical results demonstrate that ProductGNN consistently outperforms BP and standalone GNN decoders across multiple code families, achieving up to 2 dB gain for high-density codes affected by short cycles and up to 0.8 dB gain for non-binary AFC codes at a bit error rate (BER) of10−410^{-4}10−4.