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.21279

Iterative Bounded Distance Decoding With 2-Bit Reliability Marker For Product-Like Codes

Xiaowei Wu, Min Qiu, 展月英, Lei Yang

Published Oct 15, 2026• 0 citations
arXivHTMLPDF

Abstract

We propose a novel soft-aided hard-decision decoding scheme for product codes based on two-bit quantized reliability markers. In particular, one bit is used for a two-level tolerance miscorrection check to validate the bounded distance decoding (BDD) result, while the other identifies bits to be randomly flipped upon BDD failure and miscorrection. List decoding is incorporated to further facilitate the error performance. Density evolution is performed for the design of the quantization thresholds. Compared to iterative BDD, the proposed scheme requires only moderate increases in memory and computational overhead. Simulation results verify that our scheme outperforms several unquantized soft-aided decoders, while maintaining small memory costs and low BDD attempts.

DOI
10.48550/arxiv.2610.21279

Related papers

Binary Message Passing Decoding of Product-Like Codes

Alireza Sheikh, Alexandre Graell i Amat, Gianluigi Liva

We propose a novel binary message passing decoding algorithm for product-like codes based on bounded distance decoding (BDD) of the component codes. The algorithm, dubbed iterative BDD with scaled reliability (iBDD-SR), exploits the channel reliabilities and is therefore soft in nature. However, the messages exchanged by the component decoders are binary (hard) messages, which significantly reduces the decoder data flow. The exchanged binary messages are obtained by combining the channel reliability with the BDD decoder output reliabilities, properly conveyed by a scaling factor applied to the BDD decisions. We perform a density evolution analysis for generalized low-density parity-check (GLDPC) code ensembles and spatially coupled GLDPC code ensembles, from which the scaling factors of the iBDD-SR for product and staircase codes, respectively, can be obtained. For the white additive Gaussian noise channel, we show performance gains up to 0.29 dB and 0.31 dB for product and staircase codes compared to conventional iterative BDD (iBDD) with the same decoder data flow. Furthermore, we show that iBDD-SR approaches the performance of ideal iBDD that prevents miscorrections.

arXiv:1902.03575•IEEE Transactions on Communications•Sep 11, 2019•51 citations

A Threshold-Based Binary Message Passing Decoder With Memory for Product Codes

Xinwei Zhao, Shancheng Zhao, Qingyong Deng +2 more

Product codes (PCs) are typically decoded using iterative bounded distance decoding (iBDD) to ensure a low decoding complexity. To obtain further performance gain, a soft-aided decoding algorithm, termed the iBDD with scaled reliability (iBDD-SR), was proposed for PCs. In this paper, we propose an enhanced iBDD-SR by introducing threshold and memory when passing messages between the component decoders. The resulting algorithm is referred to as the threshold-based binary message passing (TB-BMP) with memory. In the proposed decoding algorithm, the soft reliability of the BDD output at the current half-iteration is a weighted sum of the BDD output, the channel reliability, and the content of the memory unit, where the content of the memory unit at the current half-iteration is related to the selected threshold and the BDD output at last half-iteration. Due to the existence of memory, the Bayesian network is used to model the decoding process of the TB-BMP. Based on the Bayesian network, we derive the density evolution (DE) equations for the TB-BMP under the constraint of extrinsic message passing (EMP). The analytical results of the DE analysis can be used to guide the selection of the parameters of the TB-BMP decoder. Extensive simulation results show that the TB-BMP decoder outperforms the iBDD-SR over the binary-input additive white Gaussian noise (Bi-AWGN) channels. In particular, for a PC based on a two-error-correcting extended Bose-Chaudhuri-Hocquenghem (BCH) code of length 256, the TB-BMP decoder performs about 0.28 dB better than the iBDD-SR at a bit error rate (BER) of 10-7.

IEEE Transactions on Communications•Mar 29, 2024•9 citations

Enhanced Guessing Random Additive Noise Decoding via Bit Marking for Product Codes

Yi Lei, Minjie Xu, Alex Alvarado +1 more

Iterative GRAND (IGRAND) is attractive for its universality and low complexity, but its exhaustive search over all bits can lead to redundant attempts and potential miscorrections. To address these issues, this letter proposes an enhanced IGRAND decoder for product codes based on bit marking, termed BM-IGRAND. Specifically, the decoder exploits soft information to classify received bits into three reliability levels via two thresholds, thereby eliminating highly reliable bits from the error search space and restricting the search to unreliable bits (UBs) and highly unreliable bits (HUBs). The test error pattern (TEP) ordering is further optimized by considering the error probabilities of HUBs/UBs and the size of the candidate combinations. Simulation results show that at a BER of$10^{-5}$, BM-IGRAND achieves up to 1 dB gain over hard-decision IGRAND while reducing the number of TEP attempts by over 50%.

IEEE Communications Letters•Jan 1, 2026•0 citations

Decoder-Aided Reliability Reweighting for Ordered Statistics Decoding

Feodosii Kotov, Ivanov Fedor

Ordered statistics decoding (OSD) is a powerful near-maximum likelihood decoding technique for short linear block codes, but its performance strongly depends on the reliability ordering used to construct the most reliable basis (MRB). In particular, decoding failures of low-order OSD are often caused by erroneous bits being included in the MRB due to unreliable channel observations. In this paper, we propose a decoderaided reliability reweighting approach for OSD. The method incorporates decisions of a bounded-distance decoder (BDD) into the reliability ordering stage by adjusting channel log-likelihood ratios using a simple additive rule. The resulting reliability metric combines soft channel information with structural information provided by the algebraic decoder. A probabilistic interpretation of the proposed rule is obtained by modeling the BDD output as a binary symmetric channel. To avoid explicit estimation of decoder error probability, we further introduce a self-normalized weighting strategy based on the median magnitude of channel LLRs. The proposed approach preserves the classical OSD search structure and requires only a single invocation of BDD per frame. Simulation results for BCH codes demonstrate consistent improvements in BER and FER compared with conventional OSD while maintaining the same decoding order and complexity.

International Siberian workshops and tutorials on electron devices and materials•Jun 1, 2026•0 citations

Hard-Decision Iterative Decoding of LDPC Codes with Bounded Error Rate

Paolo Santini, Massimo Battaglioni, Marco Baldi +1 more

Differently from bounded-distance decoders used for algebraic codes, iterative decoders used for low-density parity-check (LDPC) codes are not characterized by a deterministic decoding radius. Therefore, the error rates of LDPC-coded transmissions are usually estimated heuristically through simulations. This is adequate for many applications like wireless communications, where a frame error rate (FER) in the order of 10-6or higher is usually targeted. However, lower values of FER can barely be assessed through simulations, and this limits the use of LDPC codes in applications requiring a lower FER, like optical communications and code-based cryptography. In this paper we introduce and study a version of the classic bit flipping (BF) decoder for which we are able to devise and develop a theoretical characterization of the FER. In addition, we consider a two-iteration hard-decision decoder for LDPC codes derived from BF, and discuss its error rate performance. Our results are validated through numerical simulations.

International Conference on Communications•May 1, 2019•15 citations

Iterative Bounded Distance Decoding of Product Codes with Scaled Reliability

Alireza Sheikh, Alexandre Graell i Amat, Gianluigi Liva

We propose a modified iterative bounded distance decoding of product codes. The proposed algorithm is based on exchanging hard messages iteratively and exploiting channel reliabilities to make hard decisions at each iteration. Performance improvements up to 0.26 dB are achieved.

arXiv:1805.05270•European Conference on Optical Communication•Sep 1, 2018•26 citations
We propose a novel soft-aided hard-decision decoding scheme for product codes based on two-bit quantized reliability markers. In particular, one bit is used for a two-level tolerance miscorrection check to validate the bounded distance decoding (BDD) result, while the other identifies bits to be randomly flipped upon BDD failure and miscorrection. List decoding is incorporated to further facilitate the error performance. Density evolution is performed for the design of the quantization thresholds. Compared to iterative BDD, the proposed scheme requires only moderate increases in memory and computational overhead. Simulation results verify that our scheme outperforms several unquantized soft-aided decoders, while maintaining small memory costs and low BDD attempts.
We propose a novel binary message passing decoding algorithm for product-like codes based on bounded distance decoding (BDD) of the component codes. The algorithm, dubbed iterative BDD with scaled reliability (iBDD-SR), exploits the channel reliabilities and is therefore soft in nature. However, the messages exchanged by the component decoders are binary (hard) messages, which significantly reduces the decoder data flow. The exchanged binary messages are obtained by combining the channel reliability with the BDD decoder output reliabilities, properly conveyed by a scaling factor applied to the BDD decisions. We perform a density evolution analysis for generalized low-density parity-check (GLDPC) code ensembles and spatially coupled GLDPC code ensembles, from which the scaling factors of the iBDD-SR for product and staircase codes, respectively, can be obtained. For the white additive Gaussian noise channel, we show performance gains up to 0.29 dB and 0.31 dB for product and staircase codes compared to conventional iterative BDD (iBDD) with the same decoder data flow. Furthermore, we show that iBDD-SR approaches the performance of ideal iBDD that prevents miscorrections.
Product codes (PCs) are typically decoded using iterative bounded distance decoding (iBDD) to ensure a low decoding complexity. To obtain further performance gain, a soft-aided decoding algorithm, termed the iBDD with scaled reliability (iBDD-SR), was proposed for PCs. In this paper, we propose an enhanced iBDD-SR by introducing threshold and memory when passing messages between the component decoders. The resulting algorithm is referred to as the threshold-based binary message passing (TB-BMP) with memory. In the proposed decoding algorithm, the soft reliability of the BDD output at the current half-iteration is a weighted sum of the BDD output, the channel reliability, and the content of the memory unit, where the content of the memory unit at the current half-iteration is related to the selected threshold and the BDD output at last half-iteration. Due to the existence of memory, the Bayesian network is used to model the decoding process of the TB-BMP. Based on the Bayesian network, we derive the density evolution (DE) equations for the TB-BMP under the constraint of extrinsic message passing (EMP). The analytical results of the DE analysis can be used to guide the selection of the parameters of the TB-BMP decoder. Extensive simulation results show that the TB-BMP decoder outperforms the iBDD-SR over the binary-input additive white Gaussian noise (Bi-AWGN) channels. In particular, for a PC based on a two-error-correcting extended Bose-Chaudhuri-Hocquenghem (BCH) code of length 256, the TB-BMP decoder performs about 0.28 dB better than the iBDD-SR at a bit error rate (BER) of 10-7.
Iterative GRAND (IGRAND) is attractive for its universality and low complexity, but its exhaustive search over all bits can lead to redundant attempts and potential miscorrections. To address these issues, this letter proposes an enhanced IGRAND decoder for product codes based on bit marking, termed BM-IGRAND. Specifically, the decoder exploits soft information to classify received bits into three reliability levels via two thresholds, thereby eliminating highly reliable bits from the error search space and restricting the search to unreliable bits (UBs) and highly unreliable bits (HUBs). The test error pattern (TEP) ordering is further optimized by considering the error probabilities of HUBs/UBs and the size of the candidate combinations. Simulation results show that at a BER of10−510^{-5}10−5, BM-IGRAND achieves up to 1 dB gain over hard-decision IGRAND while reducing the number of TEP attempts by over 50%.
Ordered statistics decoding (OSD) is a powerful near-maximum likelihood decoding technique for short linear block codes, but its performance strongly depends on the reliability ordering used to construct the most reliable basis (MRB). In particular, decoding failures of low-order OSD are often caused by erroneous bits being included in the MRB due to unreliable channel observations. In this paper, we propose a decoderaided reliability reweighting approach for OSD. The method incorporates decisions of a bounded-distance decoder (BDD) into the reliability ordering stage by adjusting channel log-likelihood ratios using a simple additive rule. The resulting reliability metric combines soft channel information with structural information provided by the algebraic decoder. A probabilistic interpretation of the proposed rule is obtained by modeling the BDD output as a binary symmetric channel. To avoid explicit estimation of decoder error probability, we further introduce a self-normalized weighting strategy based on the median magnitude of channel LLRs. The proposed approach preserves the classical OSD search structure and requires only a single invocation of BDD per frame. Simulation results for BCH codes demonstrate consistent improvements in BER and FER compared with conventional OSD while maintaining the same decoding order and complexity.
Differently from bounded-distance decoders used for algebraic codes, iterative decoders used for low-density parity-check (LDPC) codes are not characterized by a deterministic decoding radius. Therefore, the error rates of LDPC-coded transmissions are usually estimated heuristically through simulations. This is adequate for many applications like wireless communications, where a frame error rate (FER) in the order of 10-6or higher is usually targeted. However, lower values of FER can barely be assessed through simulations, and this limits the use of LDPC codes in applications requiring a lower FER, like optical communications and code-based cryptography. In this paper we introduce and study a version of the classic bit flipping (BF) decoder for which we are able to devise and develop a theoretical characterization of the FER. In addition, we consider a two-iteration hard-decision decoder for LDPC codes derived from BF, and discuss its error rate performance. Our results are validated through numerical simulations.