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

IEEE Communications Letters

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

Yi Lei, Minjie Xu, Alex Alvarado, Bin Chen

Published Jan 1, 2026• 0 citations
Publisher

Abstract

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

DOI
10.1109/lcomm.2026.3743527

Related papers

IGRAND Query Reduction using Even Codes

Arslan Riaz, Jiewei Feng, Kevin Galligan +3 more

Guessing Random Additive Noise Decoding (GRAND) algorithms can decode any moderate redundancy code of any structure, with integrated circuits demonstrating that it is possible to execute GRAND efficiently in hardware. By using GRAND as a component decoder, its remit has been extended to efficiently decode long, high redundancy product codes via the Iterative GRAND (IGRAND) algorithm in the hard detection setting. Here, by leveraging the property of even codebooks to split the noise effect search space into even and odd Hamming weights for the rows and columns in product code decoding, we demonstrate significant reductions in the number of queries IGRAND makes without any degradation in decoding performance. For IGRAND, we establish that the reduction in query numbers can be significantly higher than for the component code alone, resulting in significant efficiency gains. In particular, simulation results show that the average number of guesses reduces by a factor of 4 at a bit flip probability of $10^{-1.5}$ when the CRC $(64,53)^{2}$ codebook is used, without impacting on its decoding accuracy.

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

Ordered Reliability Direct Error Pattern Testing (ORDEPT) Algorithm

Reza Hadavian, Dmitri V. Truhachev, Kamal El‐Sankary +2 more

In this work we introduce a novel soft-decision decoding algorithm for high-rate short error-correction codes. Our results demonstrate that the proposed algorithm improves over the state-of-the-art algorithms, including recently proposed Ordered Reliability Bits Guessing Random Additive Noise Decoding (ORBGRAND), in terms of latency and decoding complexity. Specifically, we demonstrate that the ability of the proposed algorithm to find multiple candidate codewords with a reduced number of low-complexity queries makes it an efficient component decoder for iterative decoding of product-like codes.

Globecom•Dec 4, 2023•7 citations

Ordered Reliability Bits Guessing Random Additive Noise Decoding

Ken R. Duffy, Wei An, Muriel Médard

Error correction techniques traditionally focus on the co-design of restricted code-structures in tandem with code-specific decoders that are computationally efficient when decoding long codes in hardware. Modern applications are, however, driving demand for ultra-reliable low-latency communications (URLLC), rekindling interest in the performance of shorter, higher-rate error correcting codes, and raising the possibility of revisiting universal, code-agnostic decoders. To that end, here we introduce a soft-detection variant of Guessing Random Additive Noise Decoding (GRAND) called Ordered Reliability Bits GRAND that can accurately decode any moderate redundancy block-code. It is designed with efficient circuit implementation in mind, and determines accurate decodings while retaining the original hard detection GRAND algorithm's suitability for a highly parallelized implementation in hardware. ORBGRAND is shown to provide excellent soft decision block error performance for codes of distinct classes (BCH, CA-Polar and RLC) with modest complexity, while providing better block error rate performance than CA-SCL, a state of the art soft detection CA-Polar decoder. ORBGRAND offers the possibility of an accurate, energy efficient soft detection decoder suitable for delivering URLLC in a single hardware realization.

arXiv:2202.13951•IEEE Transactions on Signal Processing•Jan 1, 2022•148 citations

Ordered Reliability Direct Error Pattern Testing Decoding Algorithm

Reza Hadavian, Xiaoting Huang, Dmitri V. Truhachev +3 more

We introduce a novel universal soft-decision decoding algorithm for binary block codes called ordered reliability direct error pattern testing (ORDEPT). Our results, obtained for a variety of popular short high-rate codes, demonstrate that ORDEPT outperforms state-of-the-art decoding algorithms of comparable complexity such as ordered reliability bits guessing random additive noise decoding (ORBGRAND) in terms of the decoding error probability and latency. The improvements carry on to the iterative decoding of product codes and convolutional product-like codes, where we present a new adaptive decoding algorithm and demonstrate the ability of ORDEPT to efficiently find multiple candidate codewords to produce soft output.

arXiv:2310.12039•Oct 18, 2023•1 citation

Ordered Reliability Bits Guessing Random Additive Noise Decoding

Ken R. Duffy

Modern applications are driving demand for ultra-reliable low-latency communications, rekindling interest in the performance of short, high-rate error correcting codes. To that end, here we introduce a soft-detection variant of Guessing Random Additive Noise Decoding (GRAND) called Ordered Reliability Bits GRAND that can decode any moderate redundancy block-code. For a code of n bits, it avails of no more than ⎾log2(n)⏋ bits of code-book-independent quantized soft detection information per received bit to determine an accurate decoding while retaining the original algorithm’s suitability for a highly parallelized implementation in hardware. ORBGRAND is shown to provide similar block error performance for codes of distinct classes (BCH, CA-Polar and RLC) with low complexity, while providing better block error rate performance than CA-SCL, a state of the art soft detection CA-Polar decoder.

arXiv:2001.00546•IEEE International Conference on Acoustics Speech and Signal Processing•May 13, 2021•83 citations

Partial Ordered Statistics Decoding with Enhanced Error Patterns

Marwan Jalaleddine, Huayi Zhou, Jiajie Li +1 more

Guessing Random Additive Noise Decoding (GRAND) excels at decoding high-rate codes but struggles to decode low-rate codes with reasonable complexity. Ordered Statistics Decoding (OSD) specifically excels in decoding short codes irrespective of rates; however, OSD necessitates the use of Gaussian elimination which introduces additional time, space and computational complexity. Partial Ordered Statistics Decoding (POSD) was proposed to reduce the time, space, and computational complexity of OSD; however, the current partition-based POSD has poor decoding performance since it does not generate test error patterns across partitions. In this paper, we propose to improve the decoding performance of POSD by incorporating test error patterns inspired by GRAND methods. This work offers a trade-off between performance and complexity compared to existing decoders such as GRAND and OSD. We enhance POSD by optimizing the scheduling of Test Error Patterns (TEPs) and show that our technique can be applied to any code in a standard form. At a target BER 10−4with eBCH (128,64) the enhanced error patterns achieve more than 0.6 dB gain in performance compared to the POSD with partition-based error patterns. Moreover, at a target frame error rate of 10−5, POSD uses 10× less binary operations compared to GRAND when decoding eBCH (128,64) and RLC(128,64) codes. With BCH (127,29) and RLC(128,32), at a target frame error rate of 10−2, POSD with enhanced error patterns with a maximum number of queries (MQ) of 104achieves up to a 2 dB gain to its GRAND equivalent which is using 107maximum number of queries.

IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2023•13 citations
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%.
Guessing Random Additive Noise Decoding (GRAND) algorithms can decode any moderate redundancy code of any structure, with integrated circuits demonstrating that it is possible to execute GRAND efficiently in hardware. By using GRAND as a component decoder, its remit has been extended to efficiently decode long, high redundancy product codes via the Iterative GRAND (IGRAND) algorithm in the hard detection setting. Here, by leveraging the property of even codebooks to split the noise effect search space into even and odd Hamming weights for the rows and columns in product code decoding, we demonstrate significant reductions in the number of queries IGRAND makes without any degradation in decoding performance. For IGRAND, we establish that the reduction in query numbers can be significantly higher than for the component code alone, resulting in significant efficiency gains. In particular, simulation results show that the average number of guesses reduces by a factor of 4 at a bit flip probability of 10−1.510^{-1.5}10−1.5 when the CRC (64,53)2(64,53)^{2}(64,53)2 codebook is used, without impacting on its decoding accuracy.
In this work we introduce a novel soft-decision decoding algorithm for high-rate short error-correction codes. Our results demonstrate that the proposed algorithm improves over the state-of-the-art algorithms, including recently proposed Ordered Reliability Bits Guessing Random Additive Noise Decoding (ORBGRAND), in terms of latency and decoding complexity. Specifically, we demonstrate that the ability of the proposed algorithm to find multiple candidate codewords with a reduced number of low-complexity queries makes it an efficient component decoder for iterative decoding of product-like codes.
Error correction techniques traditionally focus on the co-design of restricted code-structures in tandem with code-specific decoders that are computationally efficient when decoding long codes in hardware. Modern applications are, however, driving demand for ultra-reliable low-latency communications (URLLC), rekindling interest in the performance of shorter, higher-rate error correcting codes, and raising the possibility of revisiting universal, code-agnostic decoders. To that end, here we introduce a soft-detection variant of Guessing Random Additive Noise Decoding (GRAND) called Ordered Reliability Bits GRAND that can accurately decode any moderate redundancy block-code. It is designed with efficient circuit implementation in mind, and determines accurate decodings while retaining the original hard detection GRAND algorithm's suitability for a highly parallelized implementation in hardware. ORBGRAND is shown to provide excellent soft decision block error performance for codes of distinct classes (BCH, CA-Polar and RLC) with modest complexity, while providing better block error rate performance than CA-SCL, a state of the art soft detection CA-Polar decoder. ORBGRAND offers the possibility of an accurate, energy efficient soft detection decoder suitable for delivering URLLC in a single hardware realization.
We introduce a novel universal soft-decision decoding algorithm for binary block codes called ordered reliability direct error pattern testing (ORDEPT). Our results, obtained for a variety of popular short high-rate codes, demonstrate that ORDEPT outperforms state-of-the-art decoding algorithms of comparable complexity such as ordered reliability bits guessing random additive noise decoding (ORBGRAND) in terms of the decoding error probability and latency. The improvements carry on to the iterative decoding of product codes and convolutional product-like codes, where we present a new adaptive decoding algorithm and demonstrate the ability of ORDEPT to efficiently find multiple candidate codewords to produce soft output.
Modern applications are driving demand for ultra-reliable low-latency communications, rekindling interest in the performance of short, high-rate error correcting codes. To that end, here we introduce a soft-detection variant of Guessing Random Additive Noise Decoding (GRAND) called Ordered Reliability Bits GRAND that can decode any moderate redundancy block-code. For a code of n bits, it avails of no more than ⎾log2(n)⏋ bits of code-book-independent quantized soft detection information per received bit to determine an accurate decoding while retaining the original algorithm’s suitability for a highly parallelized implementation in hardware. ORBGRAND is shown to provide similar block error performance for codes of distinct classes (BCH, CA-Polar and RLC) with low complexity, while providing better block error rate performance than CA-SCL, a state of the art soft detection CA-Polar decoder.
Guessing Random Additive Noise Decoding (GRAND) excels at decoding high-rate codes but struggles to decode low-rate codes with reasonable complexity. Ordered Statistics Decoding (OSD) specifically excels in decoding short codes irrespective of rates; however, OSD necessitates the use of Gaussian elimination which introduces additional time, space and computational complexity. Partial Ordered Statistics Decoding (POSD) was proposed to reduce the time, space, and computational complexity of OSD; however, the current partition-based POSD has poor decoding performance since it does not generate test error patterns across partitions. In this paper, we propose to improve the decoding performance of POSD by incorporating test error patterns inspired by GRAND methods. This work offers a trade-off between performance and complexity compared to existing decoders such as GRAND and OSD. We enhance POSD by optimizing the scheduling of Test Error Patterns (TEPs) and show that our technique can be applied to any code in a standard form. At a target BER 10−4with eBCH (128,64) the enhanced error patterns achieve more than 0.6 dB gain in performance compared to the POSD with partition-based error patterns. Moreover, at a target frame error rate of 10−5, POSD uses 10× less binary operations compared to GRAND when decoding eBCH (128,64) and RLC(128,64) codes. With BCH (127,29) and RLC(128,32), at a target frame error rate of 10−2, POSD with enhanced error patterns with a maximum number of queries (MQ) of 104achieves up to a 2 dB gain to its GRAND equivalent which is using 107maximum number of queries.