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:2610.32807

Beam Search for Error-Correcting Codes via Conditional Diffusion

Ziv Aharoni, Henry D. Pfister

Published Oct 23, 2026• 0 citations
arXivHTMLPDF

Abstract

We introduce a diffusion framework for neural decoding of error-correcting codes (ECCs). We interpret decoding as a conditional diffusion process that progressively predicts codeword bits while treating the physical channel observation as fixed side information. At each stage, a neural model estimates bitwise posteriors conditioned on the physical observation and the current noisy state of the codeword. We focus particularly on masked diffusion, for which the reverse process naturally induces a Maxwell beam search (MBS) procedure inspired by the Maxwell construction of Measson et al. Rather than committing to a single uncertain decision, the decoder maintains multiple candidate trajectories, removes parity-infeasible candidates, and ranks the remaining candidates using accumulated reverse-transition log-probabilities. We evaluate the framework across multiple code families on binary phase-shift keying (BPSK) over additive white Gaussian noise (AWGN). Experiments show competitive decoding performance across Polar, low-density parity-check (LDPC), and Bose-Chaudhuri-Hocquenghem (BCH) codes. The MBS decoder consistently improves upon the corresponding single-trajectory diffusion decoder and, in all evaluated settings, improves upon available neural decoding results.

DOI
10.48550/arxiv.2610.32807

Related papers

Denoising Diffusion Error Correction Codes

Yoni Choukroun, Lior Wolf

Error correction code (ECC) is an integral part of the physical communication layer, ensuring reliable data transfer over noisy channels. Recently, neural decoders have demonstrated their advantage over classical decoding techniques. However, recent state-of-the-art neural decoders suffer from high complexity and lack the important iterative scheme characteristic of many legacy decoders. In this work, we propose to employ denoising diffusion models for the soft decoding of linear codes at arbitrary block lengths. Our framework models the forward channel corruption as a series of diffusion steps that can be reversed iteratively. Three contributions are made: (i) a diffusion process suitable for the decoding setting is introduced, (ii) the neural diffusion decoder is conditioned on the number of parity errors, which indicates the level of corruption at a given step, (iii) a line search procedure based on the code's syndrome obtains the optimal reverse diffusion step size. The proposed approach demonstrates the power of diffusion models for ECC and is able to achieve state of the art accuracy, outperforming the other neural decoders by sizable margins, even for a single reverse diffusion step.

arXiv:2209.13533•Sep 16, 2022•30 citations

Syndrome-Flow Consistency Model Achieves One-step Denoising Error Correction Codes

Lei, Haoyu, Chin Wa Lau, Kaiwen Zhou +2 more

Error Correction Codes (ECC) are fundamental to reliable digital communication, yet designing neural decoders that are both accurate and computationally efficient remains challenging. Recent denoising diffusion decoders achieve state-of-the-art performance, but their iterative sampling limits practicality in low-latency settings. To bridge this gap, consistency models (CMs) offer a potential path to high-fidelity one-step decoding. However, applying CMs to ECC presents a significant challenge: the discrete nature of error correction means the decoding trajectory is highly non-smooth, making it incompatible with a simple continuous timestep parameterization. To address this, we re-parameterize the reverse Probability Flow Ordinary Differential Equation (PF-ODE) by soft-syndrome condition, providing a smooth trajectory of signal corruption. Building on this, we propose the Error Correction Syndrome-Flow Consistency Model (ECCFM), a model-agnostic framework designed specifically for ECC task, ensuring the model learns a smooth trajectory from any noisy signal directly to the original codeword in a single step. Across multiple benchmarks, ECCFM attains lower bit-error-rate (BER) and frame-error-rate (FER) than transformer-based decoders, while delivering inference speeds 30x to 100x faster than iterative denoising diffusion decoders.

arXiv:2512.01389•Dec 1, 2025•5 citations

Multiple Diffusion Sampling Decoding for Binary Block Codes

Jiahuan Ni, Jian Zheng, Zongyao Li +2 more

Denoising diffusion error correction code (DDECC) is a recent state-of-the-art neural decoding framework by casting decoding as a deterministic reverse diffusion process conditioned on parity-check errors. However, its heuristic step parameterization and lack of sample diversity limit decoding performance. We propose a time-conditioned diffusion-based decoder that reformulates the decoding task as a discrete-time reverse diffusion process driven by an advanced diffusion sampler. Our method introduces two key components: (i) a Transformerbased denoiser conditioned on diffusion time steps, and (ii) an initialization that maps the received signal to a valid diffusion state. To further enhance error correction, we propose a multiple diffusion sampling (MDS) algorithm that leverages stochasticity to generate L parallel decoding trajectories for enhanced solution exploration. Experiments on $(63,45) \mathbf{B C H}$ and $(64,42)$ polar codes show that our decoder can achieve superior decoding accuracy over DDECC with reduced complexity. As L increases, MDS approaches maximum-likelihood performance.

SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems•Nov 1, 2025•1 citation

Denoising Diffusion Decoding with U-Shaped Error Correction Code Transformers

Elaheh Bassak, Elvino Silveira Sousa

Recent neural decoders substantially improve error correction for short block codes but remain computationally intensive and lack adaptive refinement. This work introduces enhanced U-shaped transformer architectures with two key innovations: (i) double-masked attention from complementary parity-check matrices for improved structural diversity, and (ii) cross-attention message-passing that bridges neural and classical decoding principles. To enable adaptive iterative refinement, we extend these single-shot U-shaped decoders into the denoising diffusion paradigm, where channel corruption is modeled as a forward diffusion process and iteratively reversed based on continuous soft syndrome conditioning. Our key finding demonstrates that U-shaped backbones provide disproportionately larger performance gains under diffusion compared to shallow or deep alternatives, nearly matching deep architectures while utilizing half the parameters. Extensive experiments on LDPC(49,24) and Polar(64,32) codes show that the proposed diffusion-enhanced U-shaped transformers achieve state-of-the-art bit-error-rate performance while achieving superior computational efficiency.

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

TCD: Time-Conditioned Diffusion Decoding for Binary Short Block Codes

Jian Zheng, Jiahuan Ni, Zongyao Li +4 more

Neural channel decoders have attracted growing attention as promising routes for high-performance decoding of short block codes. A recent milestone is denoising diffusion error correction codes (DDECC), which fuses diffusion probabilistic models with a Transformer-based denoiser and outperforms earlier neural approaches. Yet its customized line-search update lacks formal convergence guarantees, and its convergence speed and decoding accuracy can still be improved. To overcome these limitations, we propose time-conditioned diffusion (TCD) decoder, a continuous-time neural decoder built upon stochastic differential equation (SDE) theory. TCD leverages high-order diffusion samplers to achieve theoretically-grounded, fast convergence. It further introduces 1) a time-conditioned Transformer-based denoiser with continuous embeddings, 2) an initialization that maps received signals to valid diffusion states, and 3) an early-stopping rule tailored for decoding. Moreover, we derive three analytically driven, low-complexity guidance schemes—likelihood-gradient, posterior-mean, and their hybrid—conditioned on the received signal to further enhance decoding accuracy. Simulations on BCH, LDPC, Polar codes show that guided TCD outperforms DDECC across nearly all settings while markedly reducing computational cost. Against other universal neural decoders, TCD achieves state-of-the-art performance, further closing the gap to maximum-likelihood decoding.

IEEE Transactions on Cognitive Communications and Networking•Jan 1, 2026•0 citations

Certified Adaptive List Decoding for Error-Correcting Codes

Jaeho Hwang, Byung-Sun Won, Uiwon Hwang

Maximum-likelihood (ML) decoding of linear block codes is NP-hard, so neural decoders are evaluated by how closely they approach it. We observe that proving a candidate optimal can be far easier than finding it, and build a decoder that does both. We cast decoding as a search over an absorbing-state discrete diffusion model, whose sequential commitment of coordinates turns generation into a tree, and run a probability beam search over it. A dual bound from a linear-programming relaxation and a distance-based test, both derived from the code, then certify per frame that the current candidate is the global ML solution; because both are theorems, certified frames incur no accuracy-computation trade-off. Across $15$ codes and five operating points we certify up to $99.9\%$ of frames, the two tests dividing the space as their derivations predict, one strong for sparse parity-check matrices and the other for codes with a large minimum distance. Certification also behaves as a per-frame reliability signal, with $96.7$-$100\%$ of all frame errors falling on uncertified frames. Against an exact ML reference at $5$ dB the decoder is within one standard deviation on three of the four codes where the reference is uncensored, and against four neural baselines it attains the best bit-error rate in $71$ of $75$ cells.

arXiv:2610.27805•Oct 20, 2026•0 citations
We introduce a diffusion framework for neural decoding of error-correcting codes (ECCs). We interpret decoding as a conditional diffusion process that progressively predicts codeword bits while treating the physical channel observation as fixed side information. At each stage, a neural model estimates bitwise posteriors conditioned on the physical observation and the current noisy state of the codeword. We focus particularly on masked diffusion, for which the reverse process naturally induces a Maxwell beam search (MBS) procedure inspired by the Maxwell construction of Measson et al. Rather than committing to a single uncertain decision, the decoder maintains multiple candidate trajectories, removes parity-infeasible candidates, and ranks the remaining candidates using accumulated reverse-transition log-probabilities. We evaluate the framework across multiple code families on binary phase-shift keying (BPSK) over additive white Gaussian noise (AWGN). Experiments show competitive decoding performance across Polar, low-density parity-check (LDPC), and Bose-Chaudhuri-Hocquenghem (BCH) codes. The MBS decoder consistently improves upon the corresponding single-trajectory diffusion decoder and, in all evaluated settings, improves upon available neural decoding results.
Error correction code (ECC) is an integral part of the physical communication layer, ensuring reliable data transfer over noisy channels. Recently, neural decoders have demonstrated their advantage over classical decoding techniques. However, recent state-of-the-art neural decoders suffer from high complexity and lack the important iterative scheme characteristic of many legacy decoders. In this work, we propose to employ denoising diffusion models for the soft decoding of linear codes at arbitrary block lengths. Our framework models the forward channel corruption as a series of diffusion steps that can be reversed iteratively. Three contributions are made: (i) a diffusion process suitable for the decoding setting is introduced, (ii) the neural diffusion decoder is conditioned on the number of parity errors, which indicates the level of corruption at a given step, (iii) a line search procedure based on the code's syndrome obtains the optimal reverse diffusion step size. The proposed approach demonstrates the power of diffusion models for ECC and is able to achieve state of the art accuracy, outperforming the other neural decoders by sizable margins, even for a single reverse diffusion step.
Error Correction Codes (ECC) are fundamental to reliable digital communication, yet designing neural decoders that are both accurate and computationally efficient remains challenging. Recent denoising diffusion decoders achieve state-of-the-art performance, but their iterative sampling limits practicality in low-latency settings. To bridge this gap, consistency models (CMs) offer a potential path to high-fidelity one-step decoding. However, applying CMs to ECC presents a significant challenge: the discrete nature of error correction means the decoding trajectory is highly non-smooth, making it incompatible with a simple continuous timestep parameterization. To address this, we re-parameterize the reverse Probability Flow Ordinary Differential Equation (PF-ODE) by soft-syndrome condition, providing a smooth trajectory of signal corruption. Building on this, we propose the Error Correction Syndrome-Flow Consistency Model (ECCFM), a model-agnostic framework designed specifically for ECC task, ensuring the model learns a smooth trajectory from any noisy signal directly to the original codeword in a single step. Across multiple benchmarks, ECCFM attains lower bit-error-rate (BER) and frame-error-rate (FER) than transformer-based decoders, while delivering inference speeds 30x to 100x faster than iterative denoising diffusion decoders.
Denoising diffusion error correction code (DDECC) is a recent state-of-the-art neural decoding framework by casting decoding as a deterministic reverse diffusion process conditioned on parity-check errors. However, its heuristic step parameterization and lack of sample diversity limit decoding performance. We propose a time-conditioned diffusion-based decoder that reformulates the decoding task as a discrete-time reverse diffusion process driven by an advanced diffusion sampler. Our method introduces two key components: (i) a Transformerbased denoiser conditioned on diffusion time steps, and (ii) an initialization that maps the received signal to a valid diffusion state. To further enhance error correction, we propose a multiple diffusion sampling (MDS) algorithm that leverages stochasticity to generate L parallel decoding trajectories for enhanced solution exploration. Experiments on (63,45)BCH(63,45) \mathbf{B C H}(63,45)BCH and (64,42)(64,42)(64,42) polar codes show that our decoder can achieve superior decoding accuracy over DDECC with reduced complexity. As L increases, MDS approaches maximum-likelihood performance.
Recent neural decoders substantially improve error correction for short block codes but remain computationally intensive and lack adaptive refinement. This work introduces enhanced U-shaped transformer architectures with two key innovations: (i) double-masked attention from complementary parity-check matrices for improved structural diversity, and (ii) cross-attention message-passing that bridges neural and classical decoding principles. To enable adaptive iterative refinement, we extend these single-shot U-shaped decoders into the denoising diffusion paradigm, where channel corruption is modeled as a forward diffusion process and iteratively reversed based on continuous soft syndrome conditioning. Our key finding demonstrates that U-shaped backbones provide disproportionately larger performance gains under diffusion compared to shallow or deep alternatives, nearly matching deep architectures while utilizing half the parameters. Extensive experiments on LDPC(49,24) and Polar(64,32) codes show that the proposed diffusion-enhanced U-shaped transformers achieve state-of-the-art bit-error-rate performance while achieving superior computational efficiency.
Neural channel decoders have attracted growing attention as promising routes for high-performance decoding of short block codes. A recent milestone is denoising diffusion error correction codes (DDECC), which fuses diffusion probabilistic models with a Transformer-based denoiser and outperforms earlier neural approaches. Yet its customized line-search update lacks formal convergence guarantees, and its convergence speed and decoding accuracy can still be improved. To overcome these limitations, we propose time-conditioned diffusion (TCD) decoder, a continuous-time neural decoder built upon stochastic differential equation (SDE) theory. TCD leverages high-order diffusion samplers to achieve theoretically-grounded, fast convergence. It further introduces 1) a time-conditioned Transformer-based denoiser with continuous embeddings, 2) an initialization that maps received signals to valid diffusion states, and 3) an early-stopping rule tailored for decoding. Moreover, we derive three analytically driven, low-complexity guidance schemes—likelihood-gradient, posterior-mean, and their hybrid—conditioned on the received signal to further enhance decoding accuracy. Simulations on BCH, LDPC, Polar codes show that guided TCD outperforms DDECC across nearly all settings while markedly reducing computational cost. Against other universal neural decoders, TCD achieves state-of-the-art performance, further closing the gap to maximum-likelihood decoding.
Maximum-likelihood (ML) decoding of linear block codes is NP-hard, so neural decoders are evaluated by how closely they approach it. We observe that proving a candidate optimal can be far easier than finding it, and build a decoder that does both. We cast decoding as a search over an absorbing-state discrete diffusion model, whose sequential commitment of coordinates turns generation into a tree, and run a probability beam search over it. A dual bound from a linear-programming relaxation and a distance-based test, both derived from the code, then certify per frame that the current candidate is the global ML solution; because both are theorems, certified frames incur no accuracy-computation trade-off. Across 151515 codes and five operating points we certify up to 99.9%99.9\%99.9% of frames, the two tests dividing the space as their derivations predict, one strong for sparse parity-check matrices and the other for codes with a large minimum distance. Certification also behaves as a per-frame reliability signal, with 96.796.796.7-100%100\%100% of all frame errors falling on uncertified frames. Against an exact ML reference at 555 dB the decoder is within one standard deviation on three of the four codes where the reference is uncensored, and against four neural baselines it attains the best bit-error rate in 717171 of 757575 cells.